2924 search results - page 190 / 585 » Lower Bounds in Distributed Computing |
131
click to vote
ECCC
2000
15 years 3 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
136
click to vote
ISTCS
1993
Springer
15 years 7 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
131
click to vote
SMA
2010
ACM
15 years 3 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
142
click to vote
SPAA
2006
ACM
15 years 9 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
149
Voted
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...