Sciweavers

694 search results - page 88 / 139
» Open Graphs and Computational Reasoning
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 1 months 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
MP
2011
14 years 8 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
ICCV
2009
IEEE
16 years 6 months ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
CSR
2006
Springer
15 years 5 months ago
Incremental Branching Programs
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
Anna Gál, Michal Koucký, Pierre McKe...
DAC
2010
ACM
15 years 4 months ago
Electronic design automation for social networks
Online social networks are a growing internet phenomenon: they connect millions of individuals through sharing of common interests, political and religious views, careers, etc. So...
Andrew DeOrio, Valeria Bertacco