Sciweavers

501 search results - page 97 / 101
» Kernel Nearest Neighbor Algorithm
Sort
View
CIKM
2010
Springer
13 years 6 months ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
TKDE
2010
197views more  TKDE 2010»
13 years 2 months ago
Filtering Data Streams for Entity-Based Continuous Queries
The idea of allowing query users to relax their correctness requirements in order to improve performance of a data stream management system (e.g., location-based services and senso...
Reynold Cheng, Benjamin C. M. Kao, Alan Kwan, Suni...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 10 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 7 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...