Sciweavers

108 search results - page 10 / 22
» Cover Trees for Nearest Neighbor
Sort
View
GIS
2010
ACM
13 years 6 months ago
Verifying spatial queries using Voronoi neighbors
With the popularity of location-based services and the abundant usage of smart phones and GPS enabled devices, the necessity of outsourcing spatial data has grown rapidly over the...
Ling Hu, Wei-Shinn Ku, Spiridon Bakiras, Cyrus Sha...
CVPR
2005
IEEE
14 years 10 months ago
Randomized Trees for Real-Time Keypoint Recognition
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
Vincent Lepetit, Pascal Lagger, Pascal Fua
TMA
2010
Springer
137views Management» more  TMA 2010»
13 years 5 months ago
K-Dimensional Trees for Continuous Traffic Classification
Abstract. The network measurement community has proposed multiple machine learning (ML) methods for traffic classification during the last years. Although several research works ha...
Valentín Carela-Español, Pere Barlet...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 23 days ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 8 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias