1274 search results - page 3 / 255 » The Geometry of Coin-Weighing Problems |
155
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-...
137
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learni...
102
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper presents a new method for computing optimal L1
solutions for vision geometry problems, particularly for those
problems of fixed-dimension and of large-scale. Our strat...
118
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...