Sciweavers

523 search results - page 62 / 105
» Improved Approximation Algorithms for Maximum Graph Partitio...
Sort
View
JCO
2006
126views more  JCO 2006»
13 years 7 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li
MOBICOM
2006
ACM
14 years 1 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 1 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
BMCBI
2008
116views more  BMCBI 2008»
13 years 7 months ago
Algorithm of OMA for large-scale orthology inference
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
Alexander C. J. Roth, Gaston H. Gonnet, Christophe...
TON
2008
119views more  TON 2008»
13 years 7 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...