111 search results - page 21 / 23 » Randomized computations on large data sets: tight lower boun... |
TVLSI
2008
13 years 5 months ago
2008
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
SIGCOMM
1997
ACM
13 years 10 months ago
1997
ACM
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
VLDB
2003
ACM
14 years 6 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...