169 search results - page 15 / 34 » Decentralized Search with Random Costs |
IPTPS
2005
Springer
14 years 25 days ago
2005
Springer
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
WETICE
2003
IEEE
14 years 18 days ago
2003
IEEE
We try to analyze a generic model for 2-tier distributed systems, exploring the possibility of optimal cluster sizes from an information management perspective, such that the over...
CLUSTER
2008
IEEE
14 years 1 months ago
2008
IEEE
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
DEBS
2007
ACM
13 years 11 months ago
2007
ACM
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
ICB
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, a Bayesian method for face recognition is proposed based on Markov Random Fields (MRF) modeling. Constraints on image features as well as contextual relationships be...