358 search results - page 67 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
86
Voted
CF
2005
ACM
14 years 11 months ago
2005
ACM
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
NIPS
2007
14 years 11 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Today’s wirelessly networked embedded systems underlie a vast array of electronic devices, performing computation, communication, and input/output. A major design goal...
EUROPAR
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Current approaches to parallel I/O demand extensive user effort to obtain acceptable performance. This is in part due to difficulties in understanding the characteristics...
IMAGING
2003
14 years 11 months ago
2003
Computer vision applications are able to model and reconstruct three dimensional scenes from several pictures. In this work, we are interested in the group of algorithm that regis...