Sciweavers

3395 search results - page 57 / 679
» Learning to efficiently rank
Sort
View
ICPR
2006
IEEE
16 years 6 months ago
Protein Fold Recognition using a Structural Hidden Markov Model
Protein fold recognition has been the focus of computational biologists for many years. In order to map a protein primary structure to its correct 3D fold, we introduce in this pa...
Djamel Bouchaffra, Jun Tan
SIGIR
2009
ACM
15 years 12 months ago
Incorporating prior knowledge into a transductive ranking algorithm for multi-document summarization
This paper presents a transductive approach to learn ranking functions for extractive multi-document summarization. At the first stage, the proposed approach identifies topic th...
Massih-Reza Amini, Nicolas Usunier
EOR
2010
84views more  EOR 2010»
15 years 5 months ago
The selection efficiency of tournaments
We discuss tournaments in terms of their efficiency as probabilistic mechanisms that select high-quality alternatives ("players") in a noisy environment. We use two crit...
Dmitry Ryvkin
WWW
2005
ACM
15 years 11 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
Hai Zhuge, Xue Chen, Xiaoping Sun
154
Voted
COCOON
2008
Springer
15 years 7 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen