Sciweavers

3341 search results - page 19 / 669
» On Bounded Queries and Approximation
Sort
View
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 10 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 9 months ago
Convoy Queries in Spatio-Temporal Databases
We introduce a convoy query that retrieves all convoys from historical trajectories, each of which consists of a set of objects that travelled closely during a certain time period....
Hoyoung Jeung, Heng Tao Shen, Xiaofang Zhou
VLDB
2005
ACM
106views Database» more  VLDB 2005»
14 years 1 months ago
Adaptive Stream Filters for Entity-based Queries with Non-Value Tolerance
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
Reynold Cheng, Ben Kao, Sunil Prabhakar, Alan Kwan...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 11 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
JMLR
2010
140views more  JMLR 2010»
13 years 3 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman