Sciweavers

1268 search results - page 189 / 254
» An Algorithm for Distributed Beacon Selection
Sort
View
MSWIM
2006
ACM
15 years 7 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
SIGIR
2006
ACM
15 years 7 months ago
Minimal test collections for retrieval evaluation
Accurate estimation of information retrieval evaluation metrics such as average precision require large sets of relevance judgments. Building sets large enough for evaluation of r...
Ben Carterette, James Allan, Ramesh K. Sitaraman
MIR
2005
ACM
133views Multimedia» more  MIR 2005»
15 years 7 months ago
Probabilistic web image gathering
We propose a new method for automated large scale gathering of Web images relevant to specified concepts. Our main goal is to build a knowledge base associated with as many conce...
Keiji Yanai, Kobus Barnard
AUSAI
2005
Springer
15 years 7 months ago
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
Andrew Lim, Jiqing Tang
GCC
2004
Springer
15 years 7 months ago
End Host Multicast for Peer-to-Peer Systems
Abstract. Multicast is an effective means for conducting the cooperative P2P communications. This paper studies an algorithm to construct a scalable and efficient end host multica...
Wanqing Tu, Weijia Jia