540 search results - page 29 / 108 » Comparing distributions and shapes using the kernel distance |
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
89
Voted
ICS
2003
Tsinghua U.
15 years 5 months ago
2003
Tsinghua U.
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
103
Voted
BMCBI
2010
15 years 19 days ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
117
Voted
BMCBI
2007
15 years 19 days ago
2007
Background: There is a large amount of microarray data accumulating in public databases, providing various data waiting to be analyzed jointly. Powerful kernel-based methods are c...
120
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...