STOC
2000
ACM
14 years 4 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
STOC
2000
ACM
14 years 4 months ago
2000
ACM
STOC
2000
ACM
14 years 4 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
STOC
2000
ACM
14 years 4 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
SIGGRAPH
2000
ACM
14 years 4 months ago
2000
ACM
We present a new set of algorithms for line-art rendering of smooth surfaces. We introduce an efficient, deterministic algorithm for finding silhouettes based on geometric duali...
DIALM
2000
ACM
14 years 4 months ago
2000
ACM
Ï ÔÖ × ÒØ ØÛÓ Ò Û Ð Ö Ð Ø ÓÒ Ð ÓÖ Ø Ñ× ÓÖ ÑÓ Ð Ó Ò ØÛÓÖ ×º Ì Ð ÓÖ Ø Ñ× Ò×ÙÖ Ø Ø Ú ÒØÙ ÐÐÝ ÓÒÒ Ø ÓÑÔÓÒ ÒØ Ó Ø ...
DIALM
2000
ACM
14 years 4 months ago
2000
ACM
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
COMPGEOM
2000
ACM
14 years 4 months ago
2000
ACM
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
COMPGEOM
2000
ACM
14 years 4 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
WISE
2000
Springer
14 years 4 months ago
2000
Springer
Many algorithms have been proposed in the area of materialized view maintenance. They provide different capabilities and features, and have different complexity in their implement...