2137 search results - page 291 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
138
click to vote
FUIN
2010
15 years 2 months ago
2010
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...
158
click to vote
IWPEC
2004
Springer
15 years 10 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
165
click to vote
PRL
2010
14 years 11 months ago
2010
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
143
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
152
click to vote
EMMCVPR
2007
Springer
15 years 11 months ago
2007
Springer
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...