Sciweavers

26 search results - page 1 / 6
» Computing Betti Numbers via Combinatorial Laplacians
Sort
View
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
13 years 9 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 5 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
12 years 11 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
CVPR
2005
IEEE
14 years 6 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
SMI
2006
IEEE
152views Image Analysis» more  SMI 2006»
13 years 11 months ago
A Laplacian Based Approach for Free-Form Deformation of Sparse Low-degree IMplicit Surfaces
Sparse Low-degree IMplicit (SLIM) surface [11] is a recently developed non-conforming surface representation. In this paper, a method for free-form deformation of SLIM surfaces is...
Yutaka Ohtake, Takashi Kanai, Kiwamu Kase