1261 search results - page 122 / 253 » Approximation algorithms for aligning points |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into f , the f-dimensional Fibonacci cube. We give b...
JAIR
2011
14 years 25 days 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...
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
BMCBI
2006
14 years 10 months ago
2006
Background: Chaos game representation of genome sequences has been used for visual representation of genome sequence patterns as well as alignment-free comparisons of sequences ba...
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...