Sciweavers

287 search results - page 26 / 58
» Constant Factor Approximations for the Hotlink Assignment Pr...
Sort
View
COCOON
2005
Springer
14 years 2 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 8 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 7 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
ICASSP
2008
IEEE
14 years 3 months ago
Collusion-aware traitor tracing in multimedia fingerprinting using sparse signal approximation
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
David P. Varodayan, Christine Pépin
FSTTCS
2010
Springer
13 years 6 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...