4377 search results - page 612 / 876 » Mass problems and randomness |
181
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
187
Voted
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
163
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
215
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
136
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Systems biologists are often faced with competing models for a given experimental system. Unfortunately, performing experiments can be time-consuming and expensive. Therefore, ...