516 search results - page 26 / 104 » Processing Queries in a Large Peer-to-Peer System |
112
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
89
Voted
KDD
2007
ACM
16 years 5 days ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
156
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
111
click to vote
CBMS
2009
IEEE
15 years 6 months ago
2009
IEEE
Assessment of the (Multi) Similarity among a set of protein structures is achieved through an ensemble of protein structure comparison methods/algorithms. This leads to the genera...
120
click to vote
USENIX
2008
15 years 2 months ago
2008
This paper describes Mortar, a distributed stream processing platform for building very large queries across federated systems (enterprises, grids, datacenters, testbeds). Nodes i...