Sciweavers

1101 search results - page 193 / 221
» Fault-Tolerance in Distributed Query Processing
Sort
View
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
SIGIR
2005
ACM
15 years 3 months ago
Server selection methods in hybrid portal search
The TREC .GOV collection makes a valuable web testbed for distributed information retrieval methods because it is naturally partitioned and includes 725 web-oriented queries with ...
David Hawking, Paul Thomas
HPDC
2010
IEEE
14 years 10 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
TASLP
2008
176views more  TASLP 2008»
14 years 9 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
ICDCS
2012
IEEE
13 years 1 days ago
MOVE: A Large Scale Keyword-Based Content Filtering and Dissemination System
—The Web 2.0 era is characterized by the emergence of a very large amount of live content. A real time and finegrained content filtering approach can precisely keep users upto-...
Weixiong Rao, Lei Chen 0002, Pan Hui, Sasu Tarkoma