Sciweavers

1244 search results - page 169 / 249
» Searching in Higher Dimension
Sort
View
COMGEO
2011
ACM
13 years 5 months ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
SIGMOD
2003
ACM
125views Database» more  SIGMOD 2003»
14 years 10 months ago
An Optimal and Progressive Algorithm for Skyline Queries
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Se...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 4 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
INFOVIS
2005
IEEE
14 years 3 months ago
Parallel Sets: Visual Analysis of Categorical Data
The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical...
Fabian Bendix, Robert Kosara, Helwig Hauser