Sciweavers

10146 search results - page 335 / 2030
» Fast FAST
Sort
View
EDBT
2010
ACM
246views Database» more  EDBT 2010»
15 years 11 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
EDBT
2010
ACM
116views Database» more  EDBT 2010»
15 years 11 months ago
HARRA: fast iterative hashed record linkage for large-scale data collections
We study the performance issue of the “iterative” record linkage (RL) problem, where match and merge operations may occur together in iterations until convergence emerges. We ...
Hung-sik Kim, Dongwon Lee
ISBRA
2010
Springer
15 years 11 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
15 years 11 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
AINA
2009
IEEE
15 years 11 months ago
Enabling Fast Bootstrap of Reputation in P2P Mobile Networks
The easy deployment of P2P self-organized systems has contributed to their wide diffusion and to the definition of a new communication paradigm. Mobile communities can now sponta...
Roberto G. Cascella