969 search results - page 132 / 194 » A New Metric Between Polygons and How to Compute it |
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
ICNP
2007
IEEE
14 years 3 months ago
2007
IEEE
— P2P streaming tries to achieve scalability (like P2P file distribution) and at the same time meet real-time playback requirements. It is a challenging problem still not well u...
P2P
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— Grid resource providers can use gossiping to disseminate their available resource state to remote regions of the grid to attract application load. Pairwise gossiping pr...
LCN
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— Following widespread availability of wireless Internet, a wide range of applications with differing QoS requirements must share the wireless access. The objective of th...
CPM
2000
Springer
14 years 1 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...