420 search results - page 50 / 84 » Some Algorithmic Problems in Polytope Theory |
DNA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several rese...
CISSE
2008
Springer
14 years 11 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...