2398 search results - page 168 / 480 » Constraint Programming and Graph Algorithms |
178
Voted
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
173
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
181
click to vote
DSN
2003
IEEE
15 years 11 months ago
2003
IEEE
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
157
Voted
SPIN
2007
Springer
16 years 13 days ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
137
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...