4843 search results - page 370 / 969 » The Shortcut Problem - Complexity and Approximation |
142
click to vote
JAIR
2011
14 years 7 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
166
click to vote
COMGEO
2012
ACM
14 years 6 days ago
2012
ACM
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
167
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
143
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
133
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...