Sciweavers

2526 search results - page 370 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
146
Voted
LWA
2004
15 years 5 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
CLEF
2010
Springer
15 years 5 months ago
DAEDALUS at WebPS-3 2010: k-Medoids Clustering Using a Cost Function Minimization
This paper describes the participation of DAEDALUS team at the WebPS-3 Task 1, regarding Web People Search. The focus of our research is to evaluate and compare the computational r...
Sara Lana-Serrano, Julio Villena-Román, Jos...
CCE
2007
15 years 3 months ago
Adaptive optimisation of noisy black-box functions inherent in microscopic models
For systems where exact constitutive relations are unknown, a microscopic level description can be alternatively used. As microscopic simulations are computationally expensive, th...
Eddie Davis, Marianthi G. Ierapetritou
GPEM
2006
127views more  GPEM 2006»
15 years 3 months ago
A hierarchical particle swarm optimizer for noisy and dynamic environments
New Particle Swarm Optimization (PSO) methods for dynamic and noisy function optimization are studied in this paper. The new methods are based on the hierarchical PSO (H-PSO) and a...
Stefan Janson, Martin Middendorf
CN
2007
154views more  CN 2007»
15 years 3 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...