Results 1  10
of
489
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1036 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
Id:31381Implementation of Binary Canonic Signed Digit Multiplier using Application Specific IC
"... This paper presents a novel highspeed Binary CSD (BCSD) multiplier which takes advantage of the benefits coming from the Canonic Signed Digit (CSD) number system, while overcoming the inherent overhead due to the CSD ternary representation. BCSD is a binary number system which allows representing a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents a novel highspeed Binary CSD (BCSD) multiplier which takes advantage of the benefits coming from the Canonic Signed Digit (CSD) number system, while overcoming the inherent overhead due to the CSD ternary representation. BCSD is a binary number system which allows representing
Iterative quantization: A procrustean approach to learning binary codes
 In Proc. of the IEEE Int. Conf. on Computer Vision and Pattern Recognition (CVPR
, 2011
"... This paper addresses the problem of learning similaritypreserving binary codes for efficient retrieval in largescale image collections. We propose a simple and efficient alternating minimization scheme for finding a rotation of zerocentered data so as to minimize the quantization error of mapping t ..."
Abstract

Cited by 157 (6 self)
 Add to MetaCart
such as canonical correlation analysis (CCA). Our experiments show that the resulting binary coding schemes decisively outperform several other stateoftheart methods. 1.
Verification of Arithmetic Functions with Binary Moment Diagrams
 IN DESIGN AUTOMATION CONF
, 1994
"... Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitary functions from Boolean variables to real, rational, or integer values. BM ..."
Abstract

Cited by 111 (6 self)
 Add to MetaCart
Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitary functions from Boolean variables to real, rational, or integer values
Canonical Dual Approach to Binary Factor Analysis
"... Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in BFA are computationally intractable because of the combinatorial complexity. This paper aims at an efficient approach to ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
to BFA. For parameter learning, an unconstrained binary quadratic programming (BQP) is reduced to a canonical dual problem with low computational complexity; for model selection, we adopt the Bayesian YingYang (BYY) framework to make model selection automatically during learning. In the experiments
Rank/Activity: A Canonical Form for Binary Resolution
 Automated Deduction { CADE15, number 1421 in Lecture Notes in Arti Intelligence
, 1998
"... . The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence classes capture all trees that are the same size and differ only by reordering the resolution steps. A proof procedure that combi ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence classes capture all trees that are the same size and differ only by reordering the resolution steps. A proof procedure
Verification of Arithmetic Circuits with Binary Moment Diagrams
 IN PROCEEDINGS OF THE 32ND ACM/IEEE DESIGN AUTOMATION CONFERENCE
, 1995
"... Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitrary functions from Boolean variables to integer values. BMDs can thus model ..."
Abstract

Cited by 110 (10 self)
 Add to MetaCart
Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitrary functions from Boolean variables to integer values. BMDs can thus model
Discovering Regularities in Databases Using Canonical Decomposition of Binary Relations
 JoRMiCS
, 2004
"... Abstract. Regularities in databases are directly useful for knowledge discovery and data summarization. As a mathematical background, relational algebra helped for discovering the main data structures and existing dependencies between the different attributes in a relational database. Functional, di ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
organization, text summarization, data reduction, and even for modeling human thinking. Operators on concepts need to be developed because of their general usefulness in data and information engineering. In this paper, we propose to work on a canonical decomposition of binary relations based on two operators f
Binary Strings
 Handbook of Evolutionary Computation, chapter C 1.2. IOP Publishing Ltd and
, 1997
"... Binary vectors of fixed length, the standard representation of solutions within canonical genetic algorithms, are discussed in this section, with some emphasis on the question of whether this representation should also be used for problems where the search space fundamentally differs from the space ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Binary vectors of fixed length, the standard representation of solutions within canonical genetic algorithms, are discussed in this section, with some emphasis on the question of whether this representation should also be used for problems where the search space fundamentally differs from the space
Results 1  10
of
489