2100 search results - page 75 / 420 » Learning to rank on graphs |
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
ICMLA
2009
14 years 7 months ago
2009
components of a system by susceptibility to failure. In this extended abstract, we present an ongoing project to rank the underground primary feeders of Consolidated Edison Company...
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...