Sciweavers

1061 search results - page 84 / 213
» An Experimental Study of Data Migration Algorithms
Sort
View
171
Voted
ML
1998
ACM
153views Machine Learning» more  ML 1998»
15 years 3 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun
KDD
2006
ACM
123views Data Mining» more  KDD 2006»
16 years 4 months ago
Mining rank-correlated sets of numerical attributes
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
Toon Calders, Bart Goethals, Szymon Jaroszewicz
117
Voted
WABI
2004
Springer
107views Bioinformatics» more  WABI 2004»
15 years 9 months ago
Phylogenetic Super-networks from Partial Trees
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
165
Voted
CEC
2007
IEEE
15 years 7 months ago
Evolution of classification rules for comprehensible knowledge discovery
This article, which lies within the data mining framework, proposes a method to build classifiers based on the evolution of rules. The method, named REC (Rule Evolution for Classif...
Emiliano Carreno, Guillermo Leguizamón, Nea...
117
Voted
ALENEX
2009
118views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Solving Maximum Flow Problems on Real World Bipartite Graphs
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...