854 search results - page 139 / 171 » Abstracting from Failure Probabilities |
115
click to vote
SIGIR
2003
ACM
15 years 7 months ago
2003
ACM
This paper presents an algorithm to generate possible variants for biomedical terms. The algorithm gives each variant its generation probability representing its plausibility, whi...
125
click to vote
HIPC
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
131
click to vote
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
SIGIR
2000
ACM
15 years 6 months ago
2000
ACM
Abstract The explosion of content in distributed information retrieval (IR) systems requires new mechanisms to attain timely and accurate retrieval of unstructured text. In this pa...
131
click to vote
INFOCOM
1999
IEEE
15 years 6 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...