4110 search results - page 243 / 822 » Efficient algorithms for the 2-gathering problem |
167
click to vote
ICCVW
1999
Springer
15 years 10 months ago
1999
Springer
Image-based reconstruction from randomly scattered views is a challenging problem. We present a new algorithm that extends Seitz and Dyer’s Voxel Coloring algorithm. Unlike their...
172
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
155
click to vote
JMLR
2010
15 years 1 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
161
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper, we propose a robust and efficient algorithm for generalized orthonormal discriminant vectors (GODV). The major advantage of the proposed method is the use of the ra...
157
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...