Sciweavers

5595 search results - page 959 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CSCWD
2008
Springer
15 years 8 months ago
Task partition for function tree according to innovative functional reasoning
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
Yiming Tang, Xiaoping Liu
NIPS
2007
15 years 7 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...
IJHPCA
2006
125views more  IJHPCA 2006»
15 years 6 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
INFOCOM
2010
IEEE
15 years 4 months ago
Toward the Practical Use of Network Tomography for Internet Topology Discovery
Abstract—Accurate and timely identification of the routerlevel topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomog...
Brian Eriksson, Gautam Dasarathy, Paul Barford, Ro...
ICCS
2009
Springer
15 years 3 months ago
Evaluating the Jaccard-Tanimoto Index on Multi-core Architectures
The Jaccard/Tanimoto coefficient is an important workload, used in a large variety of problems including drug design fingerprinting, clustering analysis, similarity web searching a...
Vipin Sachdeva, Douglas M. Freimuth, Chris Mueller