4009 search results - page 210 / 802 » Clustering on Complex Graphs |
175
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
116
click to vote
INTERSPEECH
2010
14 years 11 months ago
2010
The autoregressive HMM has been shown to provide efficient parameter estimation and high-quality synthesis, but in previous experiments decision trees derived from a non-autoregre...
170
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
142
click to vote
QSHINE
2005
IEEE
15 years 10 months ago
2005
IEEE
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
165
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...