Sciweavers

2463 search results - page 191 / 493
» Rankings of Directed Graphs
Sort
View
107
Voted
DAM
2006
100views more  DAM 2006»
15 years 3 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Lorenzo Traldi
121
Voted
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 7 months ago
Percolation in the Secrecy Graph
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
Amites Sarkar, Martin Haenggi
132
Voted
WWW
2009
ACM
16 years 4 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
152
Voted
BMCBI
2010
154views more  BMCBI 2010»
15 years 3 months ago
Candidate gene prioritization by network analysis of differential expression using machine learning approaches
Background: Discovering novel disease genes is still challenging for diseases for which no prior knowledge - such as known disease genes or disease-related pathways - is available...
Daniela Nitsch, Joana P. Gonçalves, Fabian ...
119
Voted
DAC
1998
ACM
15 years 7 months ago
Rate Optimal VLSI Design from Data Flow Graph
This paper considers the rate optimal VLSI design of a recursive data flow graph (DFG). Previous research on rate optimal scheduling is not directly applicable to VLSI design. We ...
Moonwook Oh, Soonhoi Ha