334 search results - page 49 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
TCSV
2002
14 years 9 months ago
2002
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...
LCN
2006
IEEE
15 years 3 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
84
Voted
DAM
2007
14 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
103
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...