133 search results - page 16 / 27 » Approximation bounds for Black Hole Search problems |
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
119
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
120
click to vote
NIPS
2008
15 years 1 months ago
2008
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
116
click to vote
SSDBM
1999
IEEE
15 years 4 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...