Sciweavers

30 search results - page 4 / 6
» Adaptively Routing P2P Queries Using Association Analysis
Sort
View
PODS
2005
ACM
124views Database» more  PODS 2005»
14 years 5 months ago
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
Serge Abiteboul, Stefan Haar, Tova Milo, Zoë ...
CCS
2011
ACM
12 years 5 months ago
Forensic investigation of the OneSwarm anonymous filesharing system
OneSwarm is a system for anonymous p2p file sharing in use by thousands of peers. It aims to provide Onion Routing-like privacy and BitTorrent-like performance. We demonstrate se...
Swagatika Prusty, Brian Neil Levine, Marc Liberato...
SIGIR
2006
ACM
13 years 11 months ago
Probabilistic latent query analysis for combining multiple retrieval sources
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
Rong Yan, Alexander G. Hauptmann
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
14 years 6 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
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 ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 7 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount