Sciweavers

359 search results - page 25 / 72
» On the number of chord diagrams
Sort
View
CAP
2010
13 years 3 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ICFCA
2009
Springer
14 years 3 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
TC
1998
13 years 8 months ago
Using Decision Diagrams to Design ULMs for FPGAs
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
Zeljko Zilic, Zvonko G. Vranesic
ISMVL
2007
IEEE
94views Hardware» more  ISMVL 2007»
14 years 2 months ago
Representations of Elementary Functions Using Edge-Valued MDDs
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...
Shinobu Nagayama, Tsutomu Sasao
SOFTVIS
2005
ACM
14 years 2 months ago
Exploiting UML dynamic object modeling for the visualization of C++ programs
In this paper we present an approach to modeling and visualizing the dynamic interactions among objects in a C++ application. We exploit UML diagrams to expressively visualize bot...
Brian A. Malloy, James F. Power