40 search results - page 1 / 8 » Combinatorial Laplacian of the Matching Complex |
COMBINATORICS
2002
13 years 7 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...
STOC
1996
ACM
13 years 11 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...
ICCV
2007
IEEE
14 years 9 months 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...
DISOPT
2007
13 years 7 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...
DCC
1996
IEEE
13 years 11 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 ...