Sciweavers

94 search results - page 16 / 19
» Boolean Function Representation Based on Disjoint-Support De...
Sort
View
DAC
1997
ACM
13 years 11 months ago
A Graph-Based Synthesis Algorithm for AND/XOR Networks
In this paper, we introduce a Shared Multiple Rooted XORbased Decomposition Diagram XORDD to represent functions with multiple outputs. Based on the XORDD representation, we dev...
Yibin Ye, Kaushik Roy
PAMI
2007
249views more  PAMI 2007»
13 years 6 months ago
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
— The traditional image representations are not suited to conventional classification methods, such as the linear discriminant analysis (LDA), because of the under sample problem...
Dacheng Tao, Xuelong Li, Xindong Wu, Stephen J. Ma...
VMV
2003
154views Visualization» more  VMV 2003»
13 years 8 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
FUIN
2008
108views more  FUIN 2008»
13 years 7 months ago
Radial View of Continuous Cellular Automata
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
Paola Flocchini, Vladimir Cezar
DAC
1999
ACM
13 years 11 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther