10988 search results - page 261 / 2198 » Algorithmic Folding Complexity |
156
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
132
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
142
Voted
PODS
2005
ACM
15 years 9 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
147
Voted
COCO
2000
Springer
15 years 8 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
148
click to vote
SIGGRAPH
1996
ACM
15 years 8 months ago
1996
ACM
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...