Sciweavers

1337 search results - page 211 / 268
» Fast computation of distance estimators
Sort
View
FOCS
1993
IEEE
14 years 1 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
ICDCS
2012
IEEE
11 years 11 months ago
NEAT: Road Network Aware Trajectory Clustering
—Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory clustering are mainly based on density and Euclidean di...
Binh Han, Ling Liu, Edward Omiecinski
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
11 years 11 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon
CAD
2006
Springer
13 years 9 months ago
On visual similarity based 2D drawing retrieval
A large amount of 2D drawings have been produced in engineering fields. To reuse and share the available drawings efficiently, we propose two methods in this paper, namely 2.5D sp...
Jiantao Pu, Karthik Ramani
CVPR
2008
IEEE
14 years 11 months ago
Robust statistics on Riemannian manifolds via the geometric median
The geometric median is a classic robust estimator of centrality for data in Euclidean spaces. In this paper we formulate the geometric median of data on a Riemannian manifold as ...
P. Thomas Fletcher, Suresh Venkatasubramanian, Sar...