Sciweavers

973 search results - page 140 / 195
» New Bounds on Crossing Numbers
Sort
View
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 11 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 10 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
TAPSOFT
1993
Springer
15 years 10 months ago
Exception Handling and Term Labelling
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
Gilles Bernot, Pascale Le Gall
FOCS
2007
IEEE
15 years 10 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
USS
2008
15 years 8 months ago
On Auditing Elections When Precincts Have Different Sizes
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest