2924 search results - page 212 / 585 » Lower Bounds in Distributed Computing |
142
click to vote
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
118
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
105
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
139
Voted
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
In the age of Grid, Cloud, volunteer computing, massively parallel applications are deployed over tens or hundreds of thousands of resources over short periods of times to complete...
125
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...