2911 search results - page 471 / 583 » A Logic of Graph Constraints |
118
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
111
click to vote
ICCV
2009
IEEE
15 years 8 months ago
2009
IEEE
Stereo matching and volumetric reconstruction are the most explored 3D scene recovery techniques in computer vision. Many existing approaches assume perspective input images and us...
122
Voted
SARA
2009
Springer
15 years 7 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
91
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
119
click to vote
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...