Sciweavers

628 search results - page 45 / 126
» Magic Counting Methods
Sort
View
FPGA
1997
ACM
120views FPGA» more  FPGA 1997»
14 years 4 days ago
Partially-Dependent Functional Decomposition with Applications in FPGA Synthesis and Mapping
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
Jason Cong, Yean-Yow Hwang
ICIP
2001
IEEE
14 years 9 months ago
(Semi-)automatic recognition of microorganisms in water
The structure of biocenosis is a powerful indicator for the condition of and changes in quality of the ecosystem. Identification and quantification of populations of microorganism...
Burkhard A. Hense, Karsten Rodenacker, Peter Gais,...
COMPGEOM
1999
ACM
14 years 9 days ago
The Path of a Triangulation
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
Oswin Aichholzer
FFA
2006
120views more  FFA 2006»
13 years 8 months ago
Enumerating permutation polynomials over finite fields by degree II
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
Sergei Konyagin, Francesco Pappalardi
JCT
2007
90views more  JCT 2007»
13 years 7 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