3341 search results - page 307 / 669 » On Bounded Queries and Approximation |
211
click to vote
SIAMCOMP
2012
13 years 9 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
221
Voted
WWW
2006
ACM
16 years 7 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
191
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
164
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
165
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...