4553 search results - page 308 / 911 » Distributed Ranked Search |
139
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
We describe and evaluate the performance of a parallel search engine that is able to cope efficiently with concurrent read/write operations. Read operations come in the usual form ...
160
click to vote
ICDCS
2005
IEEE
16 years 15 days ago
2005
IEEE
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
150
click to vote
ESA
2003
Springer
16 years 3 days ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
160
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
160
click to vote
ACNS
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (wh...