Sciweavers

1227 search results - page 100 / 246
» Approximate Kernel Clustering
Sort
View
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 3 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
15 years 4 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
FUIN
2010
143views more  FUIN 2010»
14 years 7 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
ICASSP
2011
IEEE
14 years 7 months ago
Non-flat clustering whith alpha-divergences
The scope of the well-known k-means algorithm has been broadly extended with some recent results: first, the k- means++ initialization method gives some approximation guarantees...
Olivier Schwander, Frank Nielsen
IPPS
2009
IEEE
15 years 4 months ago
Parallel solvers for dense linear systems for heterogeneous computational clusters
This paper describes the design and the implementation of parallel routines in the Heterogeneous ScaLAPACK library that solve a dense system of linear equations. This library is w...
Ravi Reddy Manumachu, Alexey L. Lastovetsky, Pedro...