Sciweavers

721 search results - page 15 / 145
» Almost universal graphs
Sort
View
113
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 24 days ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
149
Voted
MP
2011
14 years 7 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
115
Voted
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 2 months ago
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
Vineet Kahlon, Chao Wang
80
Voted
SODA
2008
ACM
59views Algorithms» more  SODA 2008»
15 years 2 months ago
Universality of random graphs
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo...