3192 search results - page 361 / 639 » The minimum latency problem |
144
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: We develop a Bayesian method based on MCMC for estimating the relative rates of pericentric and paracentric inversions from marker data from two species. The method al...
151
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
150
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
136
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
129
Voted
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...