94 search results - page 18 / 19 » Packing d-degenerate graphs |
171
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
134
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
120
Voted
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Conventional video summarization methods focus predominantly on summarizing videos along the time axis, such as building a movie trailer. The resulting video trailer tends to reta...
150
click to vote
FPGA
2007
ACM
15 years 10 months ago
2007
ACM
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
136
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...