1603 search results - page 165 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
160
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
169
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
161
click to vote
APVIS
2009
15 years 7 months ago
2009
Particle-based simulations are a popular tool for researchers in various sciences. In combination with the availability of ever larger COTS clusters and the consequently increasin...
182
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Next-best-view (NBV) planning is an important aspect for three-dimensional (3D) reconstruction within controlled environments, such as a camera mounted on a robotic arm. NBV metho...
160
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...