112 search results - page 16 / 23 » An Approximation Algorithm for Alphabet Indexing Problem |
ICDM
2009
IEEE
14 years 9 months ago
2009
IEEE
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
86
Voted
DCC
2004
IEEE
15 years 11 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
117
Voted
ALGORITHMICA
2000
14 years 11 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
WWW
2007
ACM
16 years 10 days ago
2007
ACM
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...