Sciweavers

4757 search results - page 6 / 952
» A Unique
Sort
View
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
13 years 7 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
FOCS
2010
IEEE
13 years 5 months ago
Subexponential Algorithms for Unique Games and Related Problems
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
Sanjeev Arora, Boaz Barak, David Steurer
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 5 months ago
A Unique "Nonnegative" Solution to an Underdetermined System: from Vectors to Matrices
Abstract--This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A...
Meng Wang, Weiyu Xu, Ao Tang
BMCBI
2008
156views more  BMCBI 2008»
13 years 7 months ago
The unique probe selector: a comprehensive web service for probe design and oligonucleotide arrays
Background: Nucleic acid hybridization, a fundamental technique in molecular biology, can be modified into very effective and sensitive methods for detecting particular targets mi...
Shu-Hwa Chen, Chen-Zen Lo, Ming-Chi Tsai, Chao A. ...