5499 search results - page 1005 / 1100 » Generalized Rewrite Theories |
123
click to vote
SIGCSE
2005
ACM
15 years 6 months ago
2005
ACM
Networking course projects are usually described by an informal specification and a collection of test cases. Students often misunderstand the specification or oversimplify it t...
134
click to vote
SIGECOM
2005
ACM
15 years 6 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
129
click to vote
SIGECOM
2005
ACM
15 years 6 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 ...
95
Voted
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
We present a model, based on the maximum entropy method, for analyzing various measures of retrieval performance such as average precision, R-precision, and precision-at-cutoffs....
123
Voted
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...