Sciweavers

973 search results - page 51 / 195
» New Bounds on Crossing Numbers
Sort
View
ALGORITHMICA
2011
14 years 6 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
ASIACRYPT
2004
Springer
15 years 5 months ago
Masking Based Domain Extenders for UOWHFs: Bounds and Constructions
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compr...
Palash Sarkar
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 4 days ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 4 days ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 3 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass