Sciweavers

11 search results - page 2 / 3
» Smith normal form and Laplacians
Sort
View
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 5 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
CSC
2008
13 years 6 months ago
The Dirichlet problem for the Laplace equation in a starlike domain
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
Diego Caratelli, Paolo Emilio Ricci
CAGD
2005
116views more  CAGD 2005»
13 years 5 months ago
A sharpness dependent filter for mesh smoothing
In this paper, we propose a sharpness dependent filter design based on the fairing of surface normal, whereby the filtering algorithm automatically selects a filter. This may be a...
Chun-Yen Chen, Kuo-Young Cheng
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 9 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
13 years 11 months ago
XCS for robust automatic target recognition
A primary strength of the XCS approach is its ability to create maximally accurate general rules. In automatic target recognition (ATR) there is a need for robust performance beyo...
B. Ravichandran, Avinash Gandhe, Robert E. Smith