2907 search results - page 143 / 582 » Presentations of Structures in Admissible Sets |
111
click to vote
STOC
2001
ACM
16 years 1 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
134
click to vote
ICITS
2009
14 years 10 months ago
2009
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
122
Voted
TCAD
2002
15 years 21 days ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
ICSM
2007
IEEE
15 years 7 months ago
2007
IEEE
An in-depth investigation of C preprocessor usage for portability and configuration management is presented. Three heavily-ported and widely used C++ libraries are examined. A cor...
DGCI
2000
Springer
15 years 5 months ago
2000
Springer
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...