3758 search results - page 326 / 752 » A Complete Subsumption Algorithm |
186
click to vote
PAMI
2007
15 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
191
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
207
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
167
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Many computer vision applications have to cope with large dynamic range and changing illumination conditions in the environment. Any attempt to deal with these conditions at the a...
279
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...