Sciweavers

113 search results - page 14 / 23
» On the expected value of the minimum assignment
Sort
View
AI
2002
Springer
14 years 9 months ago
Learning cost-sensitive active classifiers
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
Russell Greiner, Adam J. Grove, Dan Roth
SSDBM
2005
IEEE
159views Database» more  SSDBM 2005»
15 years 3 months ago
Clustering Moving Objects via Medoid Clusterings
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
Hans-Peter Kriegel, Martin Pfeifle
EVOW
1994
Springer
15 years 1 months ago
Competitive Evolution: A Natural Approach to Operator Selection
One of the main problems in applying evolutionary optimisation methods is the choice of operators and parameter values. This paper propose a competitive evolution method, in which ...
Q. Tuan Pham
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
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
15 years 11 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert