71 search results - page 10 / 15 » Coxeter Lattice Paths |
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
COMBINATORICS
2004
14 years 9 months ago
2004
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
ICIAP
1999
ACM
15 years 1 months ago
1999
ACM
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
MOBIHOC
2009
ACM
15 years 4 months ago
2009
ACM
Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint ...
ICCV
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...