Sciweavers

13500 search results - page 157 / 2700
» Improved analysis of D
Sort
View
96
Voted
COMPGEOM
2009
ACM
15 years 5 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
130
Voted
ICPP
2006
IEEE
15 years 6 months ago
Data-Flow Analysis for MPI Programs
Message passing via MPI is widely used in singleprogram, multiple-data (SPMD) parallel programs. Existing data-flow frameworks do not model the semantics of message-passing SPMD ...
Michelle Mills Strout, Barbara Kreaseck, Paul D. H...
SIGIR
1998
ACM
15 years 5 months ago
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...
Krishna Bharat, Monika Rauch Henzinger
107
Voted
JUCS
2008
142views more  JUCS 2008»
15 years 23 days ago
Analyzing Wiki-based Networks to Improve Knowledge Processes in Organizations
: Increasingly wikis are used to support existing corporate knowledge exchange processes. They are an appropriate software solution to support knowledge processes. However, it is n...
Claudia Müller, Benedikt Meuthrath, Anne Baum...
WABI
2005
Springer
120views Bioinformatics» more  WABI 2005»
15 years 6 months ago
A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance
Phylogenetic tree searching algorithms often produce thousands of trees which biologists save in Newick format in order to perform further analysis. Unfortunately, Newick is neithe...
Robert S. Boyer, Warren A. Hunt Jr., Serita M. Nel...