1301 search results - page 112 / 261 » Bounded Version Vectors |
160
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
150
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
135
click to vote
RANDOM
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
152
click to vote
BIRTHDAY
2008
Springer
15 years 7 months ago
2008
Springer
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not -complete and therefore not continuous in the traditional terminol...
152
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...