40 search results - page 1 / 8 » Combinatorial Laplacian of the Matching Complex |
81
Voted
COMBINATORICS
2002
14 years 10 months ago
2002
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...
128
Voted
STOC
1996
ACM
15 years 3 months ago
1996
ACM
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...
89
Voted
ICCV
2007
IEEE
16 years 26 days ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
101
Voted
DISOPT
2007
14 years 11 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
114
click to vote
DCC
1996
IEEE
15 years 3 months ago
1996
IEEE
We present here design techniques for trellis-coded vector quantizers with symmetric codebooks that facilitate lowcomplexity quantization as well as partitioning into equiprobable ...