Sciweavers

8294 search results - page 430 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 5 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
16 years 3 days ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...
CIMCA
2005
IEEE
16 years 14 days ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...
CORR
2011
Springer
217views Education» more  CORR 2011»
15 years 1 months ago
Boolean Networks Design by Genetic Algorithms
Abstract. We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with ...
Andrea Roli, Cristian Arcaroli, Marco Lazzarini, S...
NLPRS
2001
Springer
15 years 11 months ago
A Separate-and-Learn Approach to EM Learning of PCFGs
WeproposeanewapproachtoEMlearning of PCFGs. We completely separate the process of EM learning from that of parsing, andfor theformer, weintroduce a new EM algorithm called the gra...
Taisuke Sato, Shigeru Abe, Yoshitaka Kameya, Kiyoa...