Sciweavers

381 search results - page 12 / 77
» Fast Neighbor Joining
Sort
View
BIBE
2003
IEEE
15 years 3 months ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret
SCALESPACE
2009
Springer
15 years 2 months ago
From a Single Point to a Surface Patch by Growing Minimal Paths
Abstract. We introduce a novel implicit approach for surface patch segmentation in 3D images starting from a single point. Since the boundary surface of an object is locally homeom...
Fethallah Benmansour, Laurent D. Cohen
ICC
2011
IEEE
236views Communications» more  ICC 2011»
13 years 9 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...
TKDE
2008
234views more  TKDE 2008»
14 years 9 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
EUROPAR
2009
Springer
15 years 1 months ago
Surfing Peer-to-Peer IPTV: Distributed Channel Switching
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P ...
Anne-Marie Kermarrec, Erwan Le Merrer, Yaning Liu,...