Sciweavers

2905 search results - page 173 / 581
» Formal Memetic Algorithms
Sort
View
OPODIS
2008
13 years 11 months ago
Fast Geometric Routing with Concurrent Face Traversal
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
IJCAI
1993
13 years 11 months ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
ICMLA
2009
13 years 8 months ago
All-Monotony: A Generalization of the All-Confidence Antimonotony
Abstract--Many studies have shown the limits of support/confidence framework used in Apriori-like algorithms to mine association rules. One solution to cope with this limitation is...
Yannick Le Bras, Philippe Lenca, Sorin Moga, St&ea...
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 5 months ago
Large-Scale Collective Entity Matching
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being app...
Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofala...
DAM
2011
13 years 5 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès