486 search results - page 19 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
132
Voted
AUTOMATICA
2010
15 years 5 days ago
2010
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
103
Voted
CCGRID
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
CORR
2009
Springer
14 years 11 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
133
Voted
JCSS
2002
15 years 1 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
123
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...