#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2004

2017

- This year (5)
- Last 5 years (19)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kulik
- PVLDB
- 2008

The moving k nearest neighbor (MkNN) query finds the k nearest neighbors of a moving query point continuously. The high potential of reducing the query processing cost as well as the large spectrumâ€¦ (More)

- Sarana Nutanong, Edwin H. Jacox, Hanan Samet
- PVLDB
- 2011

The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point inX is close to at least one point in Yâ€¦ (More)

- Sarana Nutanong, Egemen Tanin, Rui Zhang
- DASFAA
- 2007

We introduce the visible k nearest neighbor (VkNN) query, which finds the k nearest objects that are visible to a query point. We also propose an algorithm to efficiently process the VkNN query. Weâ€¦ (More)

- Anne-Wil Harzing, Anne-Wil Harzing, +57 authors Sebastian Reiche
- 2009

We propose solutions to two recurring problems in cross-national research: response style differences and language bias. In order to do so, we conduct a methodological comparison of two differentâ€¦ (More)

- Sarana Nutanong, Hanan Samet
- 2013 IEEE 29th International Conference on Dataâ€¦
- 2013

Incrementally finding the k nearest neighbors (kNN) in a spatial network is an important problem in location-based services. One method (INE) simply applies Dijkstra's algorithm. Another method (IER)â€¦ (More)

- Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kulik
- The VLDB Journal
- 2009

The moving k nearest neighbor (MkNN) query continuously finds the k nearest neighbors of a moving query point. MkNN queries can be efficiently processed through the use of safe regions. In general, aâ€¦ (More)

- Sarana Nutanong, Egemen Tanin, Rui Zhang
- IEEE Transactions on Knowledge and Dataâ€¦
- 2010

In many applications involving spatial objects, we are only interested in objects that are directly visible from query points. In this paper, we formulate the visible k nearest neighbor (VkNN) queryâ€¦ (More)

Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interactivity for a largeâ€¦ (More)

1. ARCHITECTURE Existing Peer-to-Peer (P2P) applications are designed to provide file sharing. We envision more complex applications on P2P systems, e.g., P2P virtual-worlds, P2P auction networks,â€¦ (More)

- Sarana Nutanong, Egemen Tanin, Jie Shao, Rui Zhang, Kotagiri Ramamohanarao
- IEEE Transactions on Knowledge and Dataâ€¦
- 2012

We study the problem of finding the shortest route between two locations that includes a stopover of a given type. An example scenario of this problem is given as follows: “On the way to Bob'sâ€¦ (More)