507 search results - page 53 / 102 » Sizes of Ordered Decision Trees |
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
IPL
2010
13 years 6 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
DGO
2010
13 years 8 months ago
2010
The increasing complexity concerning leadership and management of small and medium size municipalities in Switzerland, poses high demands on executive authorities. Cockpits for mu...
DAC
1996
ACM
14 years 15 min ago
1996
ACM
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...