5595 search results - page 164 / 1119 » Approximation Algorithms for Clustering Problems |
159
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
145
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
152
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
134
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
159
click to vote
PRL
2010
15 years 3 months ago
2010
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...