780 search results - page 100 / 156 » Cost-Sharing Approximations for h |
104
click to vote
SIGIR
2005
ACM
15 years 4 months ago
2005
ACM
We formulate and study search algorithms that consider a user’s prior interactions with a wide variety of content to personalize that user’s current Web search. Rather than re...
WOWMOM
2005
ACM
15 years 4 months ago
2005
ACM
IEEE 802.11 wireless local area networks that span large buildings or campuses must comprise multiple cells, several of which must necessarily be cochannel cells. It can be shown ...
VLDB
2005
ACM
15 years 4 months ago
2005
ACM
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
112
click to vote
MIR
2004
ACM
15 years 4 months ago
2004
ACM
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matc...
126
click to vote
SIGIR
2004
ACM
15 years 4 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...