1816 search results - page 125 / 364 » A New Approach for Solving the Maximum Clique Problem |
156
click to vote
ACL
2004
15 years 7 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
176
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
157
Voted
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
164
click to vote
AIPS
2006
15 years 7 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
176
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
One of the key problems of restoring a degraded image from motion blur is the estimation of the unknown shiftinvariant linear blur filter. Several algorithms have been proposed ut...