Sciweavers

5595 search results - page 778 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CEC
2011
IEEE
14 years 6 months ago
Trainer selection strategies for coevolving rank predictors
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
Daniel L. Ly, Hod Lipson
168
Voted
CVPR
2012
IEEE
13 years 9 months ago
Multitarget data association with higher-order motion models
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
Robert T. Collins
WWW
2008
ACM
16 years 7 months ago
Efficient similarity joins for near duplicate detection
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Jeffrey Xu ...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
16 years 6 days ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
ICALP
2010
Springer
15 years 11 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket