Sciweavers

536 search results - page 8 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Hardness and Approximation of Octilinear Steiner Trees
Matthias Müller-Hannemann, Anna Schulze
JACM
2006
99views more  JACM 2006»
13 years 7 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
ICASSP
2011
IEEE
12 years 11 months ago
Iterative hard thresholding for compressed sensing with partially known support
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
Rafael E. Carrillo, Luisa F. Polania, Kenneth E. B...
ECCC
2006
88views more  ECCC 2006»
13 years 8 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
INFOCOM
2009
IEEE
14 years 2 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu