Sciweavers

756 search results - page 31 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
TCAD
2008
116views more  TCAD 2008»
13 years 8 months ago
Scalable Synthesis and Clustering Techniques Using Decision Diagrams
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown
SAC
2006
ACM
14 years 2 months ago
Digital geometry image analysis for medical diagnosis
This paper describes a new medical image analysis technique for polygon mesh surfaces of human faces for a medical diagnosis application. The goal is to explore the natural patter...
Jiandong Fang, Shiaofen Fang, Jeffrey Huang, Mihra...
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 8 months ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
14 years 5 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
CDES
2006
106views Hardware» more  CDES 2006»
13 years 9 months ago
A Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
Sirzat Kahramanli, Suleyman Tosun