1274 search results - page 103 / 255 » The Geometry of Coin-Weighing Problems |
211
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
79
Voted
IPCO
1996
14 years 11 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Creating virtual models of real spaces and objects is cumbersome and time consuming. This paper focuses on the problem of geometric reconstruction from sparse data obtained from c...
TOC
2008
14 years 10 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
102
click to vote
ARC
2008
Springer
15 years 5 days ago
2008
Springer
Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction...