3341 search results - page 248 / 669 » On Bounded Queries and Approximation |
188
click to vote
JMLR
2012
13 years 9 months ago
2012
We consider a model for which it is important, early in processing, to estimate some variables with high precision, but perhaps at relatively low recall. If some variables can be ...
180
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
164
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
280
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
148
click to vote
P2P
2009
IEEE
16 years 1 months ago
2009
IEEE
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...