303 search results - page 50 / 61 » Update Algorithms for the Sketch Data Model |
ICML
2008
IEEE
16 years 14 days ago
2008
IEEE
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
119
Voted
DMSN
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, we study the problem of processing multiple queries in a wireless sensor network. We focus on multiquery optimization at the base station level to minimize the numb...
STOC
2004
ACM
15 years 12 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...
187
Voted
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
109
Voted
JMLR
2010
14 years 6 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...