4524 search results - page 718 / 905 » The Complexity of Global Constraints |
149
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
156
click to vote
ECCV
2006
Springer
16 years 7 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
174
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
156
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
162
click to vote
MICRO
2009
IEEE
16 years 7 days ago
2009
IEEE
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...