Sciweavers

123 search results - page 13 / 25
» Enumerating Triangulation Paths
Sort
View
JCT
2006
55views more  JCT 2006»
14 years 9 months ago
A proof of the q, t-square conjecture
We prove a combinatorial formula conjectured by Loehr and Warrington for the coefficient of the sign character in (pn). Here denotes the Bergeron-Garsia nabla operator, and pn is a...
Mahir Can, Nicholas A. Loehr
70
Voted
CORR
2004
Springer
106views Education» more  CORR 2004»
14 years 9 months ago
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
Cyril Banderier, Sylviane R. Schwer
EURODAC
1994
IEEE
130views VHDL» more  EURODAC 1994»
15 years 1 months ago
RESIST: a recursive test pattern generation algorithm for path delay faults
This paper presents Resist, a recursive test pattern generation (TPG) algorithm for path delay fault testing of scan-based circuits. In contrast to other approaches, it exploits t...
Karl Fuchs, Michael Pabst, Torsten Rössel
CC
2004
Springer
122views System Software» more  CC 2004»
15 years 3 months ago
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
Erin Parker, Siddhartha Chatterjee
MIG
2010
Springer
14 years 8 months ago
Navigation Queries from Triangular Meshes
Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. ...
Marcelo Kallmann