287 search results - page 32 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
86
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
103
click to vote
STOC
2003
ACM
15 years 5 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
103
click to vote
COLT
2000
Springer
15 years 4 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
125
click to vote
PODS
2007
ACM
15 years 12 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
143
click to vote
STOC
1999
ACM
15 years 4 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...