Sciweavers

8512 search results - page 1582 / 1703
» Computing Theory With Relevance
Sort
View
STACS
2009
Springer
14 years 3 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CLUSTER
2009
IEEE
14 years 3 months ago
Utility analysis for Internet-oriented server consolidation in VM-based data centers
—Server consolidation based on virtualization technology will simplify system administration, reduce the cost of power and physical infrastructure, and improve utilization in tod...
Ying Song, Yanwei Zhang, Yuzhong Sun, Weisong Shi
FOCS
2009
IEEE
14 years 3 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
FOCS
2009
IEEE
14 years 3 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
INFOCOM
2009
IEEE
14 years 2 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
« Prev « First page 1582 / 1703 Last » Next »