Sciweavers

2040 search results - page 224 / 408
» Approximate Expectation Maximization
Sort
View
IPL
2006
97views more  IPL 2006»
15 years 3 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 3 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
135
Voted
TR
2008
117views more  TR 2008»
15 years 3 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
TWC
2008
131views more  TWC 2008»
15 years 3 months ago
Optimal transmission strategies for rayleigh fading relay channels
In this paper, a decode-and-forward (DF) single relay model in a Rayleigh fading environment is considered. The outage probability and ergodic rate for this model are derived. With...
Yonglan Zhu, Yan Xin, Pooi Yuen Kam
135
Voted
NJC
2000
99views more  NJC 2000»
15 years 3 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne