Sciweavers

2463 search results - page 21 / 493
» Rankings of Directed Graphs
Sort
View
ECSQARU
2009
Springer
14 years 2 months ago
Triangulation Heuristics for BN2O Networks
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
Petr Savický, Jirí Vomlel
JMLR
2006
125views more  JMLR 2006»
13 years 7 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
PODS
2008
ACM
114views Database» more  PODS 2008»
14 years 8 months ago
Estimating PageRank on graph streams
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
EDBT
2011
ACM
197views Database» more  EDBT 2011»
12 years 11 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
DCG
2007
83views more  DCG 2007»
13 years 7 months ago
The Genus of a Digital Image Boundary Is Determined by Its Foreground, Background, and Reeb Graphs
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...
Lowell Abrams, Donniell E. Fishkind