Sciweavers

316 search results - page 35 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
EUROCOLT
1999
Springer
15 years 1 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
14 years 10 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
BMCBI
2010
82views more  BMCBI 2010»
14 years 9 months ago
Genome-wide estimation of firing efficiencies of origins of DNA replication from time-course copy number variation data
Background: DNA replication is a fundamental biological process during S phase of cell division. It is initiated from several hundreds of origins along whole chromosome with diffe...
Huaien Luo, Juntao Li, Majid Eshaghi, Jianhua Liu,...
SWAT
2004
Springer
103views Algorithms» more  SWAT 2004»
15 years 3 months ago
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
Mark de Berg, Sergio Cabello, Panos Giannopoulos, ...