518 search results - page 51 / 104 » Beating a Random Assignment |
112
Voted
ICDCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Clustering and aggregation inherently increase wireless sensor network (WSN) lifetime by collecting information within a cluster at a cluster head, reducing the amount of data thr...
120
Voted
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
122
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
112
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
113
Voted
ISDA
2008
IEEE
15 years 9 months ago
2008
IEEE
In multi-label text databases one or more labels, or categories, can be assigned to a single document. In many such databases there can be correlation on the assignment of subsets...