4218 search results - page 728 / 844 » Complete sets of cooperations |
116
click to vote
SIGIR
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of large-scale retrieval evaluation, and we propose a statistical method for evaluating retrieval systems using incomplete judgments. Unlike existing techn...
119
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
140
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
127
click to vote
VISUALIZATION
2005
IEEE
15 years 10 months ago
2005
IEEE
Recent years have seen an immense increase in the complexity of geometric data sets. Today’s gigabyte-sized polygon models can no longer be completely loaded into the main memor...
156
click to vote
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...