2100 search results - page 301 / 420 » Learning to rank on graphs |
201
click to vote
IPL
2008
15 years 6 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
170
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
172
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
162
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
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...
162
click to vote
MICCAI
2006
Springer
16 years 7 months ago
2006
Springer
The segmentation problem appears in most medical imaging applications. Many research groups are pushing toward a whole body segmentation based on atlases. With a similar objective,...