Sciweavers

841 search results - page 161 / 169
» Approximability of Minimum AND-Circuits
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 8 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
KDD
2004
ACM
156views Data Mining» more  KDD 2004»
14 years 8 months ago
TiVo: making show recommendations using a distributed collaborative filtering architecture
We describe the TiVo television show collaborative recommendation system which has been fielded in over one million TiVo clients for four years. Over this install base, TiVo curre...
Kamal Ali, Wijnand van Stam
RECOMB
2006
Springer
14 years 8 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