4553 search results - page 245 / 911 » Distributed Ranked Search |
214
click to vote
NDSS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
170
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
211
click to vote
IJAC
2000
15 years 7 months ago
2000
Starting from a certain monoid that describes the geometry of the left self-distributivity identity, we construct an explicit realization of the free left self-distributive system ...
253
click to vote
EDBT
2002
ACM
16 years 7 months ago
2002
ACM
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
162
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...