Sciweavers

642 search results - page 100 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
COR
2004
111views more  COR 2004»
13 years 10 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
GLOBECOM
2010
IEEE
13 years 8 months ago
Relay Station Placement for Cooperative Communications in WiMAX Networks
The recently emerging WiMAX (IEEE 802.16) is a promising telecommunication technology to provide low-cost, high-speed and long-range wireless communications. To meet the growing de...
Dejun Yang, Xi Fang, Guoliang Xue, Jian Tang
ICANN
2005
Springer
14 years 3 months ago
Interpolation Mechanism of Functional Networks
In this paper, the interpolation mechanism of functional networks is discussed. A kind of fourlayer (with 1 input and 1 output unit) and a five-layer (with double input and single...
Yong-Quan Zhou, Licheng Jiao
RECOMB
2006
Springer
14 years 10 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
ICALP
2010
Springer
14 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket