Sciweavers

359 search results - page 42 / 72
» On the number of chord diagrams
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 3 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
BPM
2004
Springer
113views Business» more  BPM 2004»
14 years 2 months ago
OPCATeam - Collaborative Business Process Modeling with OPM
While collaboration has become a basic requirement for many development environments, solutions for collaborative modeling are far from being satisfact1ory. OPCATeam, which relies ...
Dov Dori, Dizza Beimel, Eran Toch
ESAW
2003
Springer
14 years 1 months ago
Patterns Reuse in the PASSI Methodology
Abstract. Design patterns already proved successful in lowering the development time and number of errors of object-oriented software; now, they are, candidate to play a similar ro...
Massimo Cossentino, Luca Sabatucci, Antonio Chella
STACS
2001
Springer
14 years 1 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
14 years 1 months ago
Critical area computation for missing material defects in VLSI circuits
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
Evanthia Papadopoulou