Sciweavers

12459 search results - page 47 / 2492
» cans 2006
Sort
View
COMBINATORICS
2002
107views more  COMBINATORICS 2002»
13 years 7 months ago
Combinatorial Laplacian of the Matching Complex
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...
Xun Dong, Michelle L. Wachs
IJCGA
2000
72views more  IJCGA 2000»
13 years 7 months ago
Quadrilateral Meshing by Circle Packing
We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these met...
Marshall W. Bern, David Eppstein
IJFCS
2000
71views more  IJFCS 2000»
13 years 7 months ago
Light Affine Logic as a Programming Language: A First Contribution
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
Luca Roversi
JCS
2000
148views more  JCS 2000»
13 years 7 months ago
Using Sample Size to Limit Exposure to Data Mining
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
Chris Clifton
JCT
2000
78views more  JCT 2000»
13 years 7 months ago
Discrete Green's Functions
We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's fu...
Fan R. K. Chung, S.-T. Yau