Sciweavers

2111 search results - page 39 / 423
» Understanding the Yarowsky Algorithm
Sort
View
SDM
2012
SIAM
312views Data Mining» more  SDM 2012»
12 years 1 months ago
Drought Detection of the Last Century: An MRF-based Approach
Droughts are one of the most damaging climate-related hazards. The late 1960s Sahel drought in Africa and the North American Dust Bowl of the 1930s are two examples of severe drou...
Qiang Fu, Arindam Banerjee, Stefan Liess, Peter K....
ENTCS
2002
120views more  ENTCS 2002»
13 years 10 months ago
Composition of Distributed Software with Algon - Concepts and Possibilities
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
Judith Bishop, Karen Renaud, Basil Worrall
CEC
2007
IEEE
14 years 5 months ago
A study on the design issues of Memetic Algorithm
— Over the recent years, there has been increasing research activities made on improving the efficacy of Memetic Algorithm (MA) for solving complex optimization problems. Partic...
Q. H. Nguyen, Yew-Soon Ong, Natalio Krasnogor
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
14 years 15 days ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
FAC
2008
100views more  FAC 2008»
13 years 10 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois