398 search results - page 7 / 80 » Spider Diagrams of Order |
136
click to vote
ECSQARU
2007
Springer
16 years 4 days ago
2007
Springer
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
188
click to vote
ISAAC
1993
Springer
15 years 10 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
163
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
158
click to vote
CCS
2006
ACM
15 years 9 months ago
2006
ACM
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
169
click to vote
ISAAC
1995
Springer
15 years 9 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...