Sciweavers

1973 search results - page 307 / 395
» The Construction of Ludic Space
Sort
View
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 10 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
ICCAD
1994
IEEE
76views Hardware» more  ICCAD 1994»
15 years 10 months ago
An efficient procedure for the synthesis of fast self-testable controller structures
The BIST implementation of a conventionally synthesized controller in most cases requires the integration of an additional register only for test purposes. This leads to some seri...
Sybille Hellebrand, Hans-Joachim Wunderlich
COMPGEOM
1994
ACM
15 years 10 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
UIST
1994
ACM
15 years 10 months ago
A Perceptually-Supported Sketch Editor
The human visual system makes a great deal more of images than the elemental marks on a surface. In the course of viewing, creating, or editing a picture, we actively construct a ...
Eric Saund, Thomas P. Moran
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 10 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate