358 search results - page 24 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
112
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
136
click to vote
VCIP
2001
15 years 3 months ago
2001
This paper describes a method for establishing dense correspondence between two images in a video sequence (motion) or in a stereo pair (disparity) in case of large displacements....
239
click to vote
ICAC
2009
IEEE
15 years 8 months ago
2009
IEEE
Increasingly, applications need to be able to self-reconfigure in response to changing requirements and environmental conditions. Autonomic computing has been proposed as a means...
144
click to vote
JMLR
2010
14 years 8 months ago
2010
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
104
click to vote
WCE
2007
15 years 3 months ago
2007
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...