Sciweavers

1100 search results - page 123 / 220
» Approximate distance oracles
Sort
View
ATAL
2011
Springer
13 years 10 months ago
Quality guarantees for region optimal DCOP algorithms
k- and t-optimality algorithms [9, 6] provide solutions to DCOPs that are optimal in regions characterized by its size and distance respectively. Moreover, they provide quality gu...
Meritxell Vinyals, Eric Shieh, Jesús Cerqui...
ICCV
2007
IEEE
16 years 2 days ago
Boosting Invariance and Efficiency in Supervised Learning
In this paper we present a novel boosting algorithm for supervised learning that incorporates invariance to data transformations and has high generalization capabilities. While on...
Andrea Vedaldi, Paolo Favaro, Enrico Grisan
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
15 years 11 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik
187
Voted
GIS
2005
ACM
15 years 11 months ago
Shapes based trajectory queries for moving objects
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
Bin Lin, Jianwen Su
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
15 years 10 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala