1261 search results - page 31 / 253 » Approximation algorithms for aligning points |
DATAMINE
2006
14 years 9 months ago
2006
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
APPROX
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
64
Voted
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
We propose an algorithm, MusicBLAST, for approximate pattern search/matching on symbolic musical data. MusicBLAST is based on the BLAST algorithm, one of the most commonly used al...
ICML
2002
IEEE
15 years 10 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
82
Voted
ASPLOS
1994
ACM
15 years 1 months ago
1994
ACM
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...