Sciweavers

2111 search results - page 64 / 423
» Understanding the Yarowsky Algorithm
Sort
View
DMIN
2009
136views Data Mining» more  DMIN 2009»
14 years 7 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 4 months ago
Application-Aware Topology Formation Algorithm for Peer-to-Peer Networks
—When constructing an unstructured P2P topology, one should consider the application running on top of it in order to achieve a good performance for the whole P2P system. It is n...
Kin Wah Kwong, Danny H. K. Tsang
HPCC
2007
Springer
15 years 4 months ago
Improving a Fault-Tolerant Routing Algorithm Using Detailed Traffic Analysis
Currently, some coarse measures like global network latency are used to compare routing protocols. These measures do not provide enough insight of traffic distribution among networ...
Abbas Nayebi, Arash Shamaei, Hamid Sarbazi-Azad
IV
2005
IEEE
149views Visualization» more  IV 2005»
15 years 3 months ago
Visualisation Techniques for Users and Designers of Layout Algorithms
Visualisation systems consisting of a set of components through which data and interaction commands flow have been explored by a number of researchers. Such hybrid and multistage ...
Greg Ross, Alistair Morrison, Matthew Chalmers