2681 search results - page 112 / 537 » Problem F |
128
click to vote
ADHOCNOW
2005
Springer
15 years 7 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
103
click to vote
ALGORITHMICA
2008
15 years 2 months ago
2008
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
ICIP
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper deals with the problem of blind source separation in fMRI data analysis. Our main contribution is to present a maximum likelihood based method to blindly separate the b...
148
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...