Sciweavers

234 search results - page 16 / 47
» Isolation, Matching, and Counting
Sort
View
JCT
2007
90views more  JCT 2007»
14 years 11 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner
COMBINATORICS
1999
70views more  COMBINATORICS 1999»
14 years 11 months ago
Tilings of Diamonds and Hexagons with Defects
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we...
Harald Helfgott, Ira M. Gessel
ICDAR
1999
IEEE
15 years 4 months ago
Heeding More Than the Top Template
We present a method of classifying a pattern using information furnished by a ranked list of templates, rather than just the best matching template. We propose a parsimonious mode...
Prateek Sarkar, George Nagy
DATE
2009
IEEE
138views Hardware» more  DATE 2009»
15 years 6 months ago
Scalable Adaptive Scan (SAS)
Scan compression has emerged as the most successful solution to solve the problem of rising manufacturing test cost. Compression technology is not hierarchical in nature. Hierarch...
Anshuman Chandra, Rohit Kapur, Yasunari Kanzawa
CONCUR
2004
Springer
15 years 5 months ago
An Extensional Spatial Logic for Mobile Processes
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...
Daniel Hirschkoff