18 search results - page 3 / 4 » A Quadratic-Time Response Time Upper Bound with a Tightness ... |
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
ICALP
2011
Springer
12 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
CORR
2011
Springer
13 years 24 days ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
SIGMOD
2006
ACM
14 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...