Sciweavers

3134 search results - page 177 / 627
» Computing full disjunctions
Sort
View
115
Voted
HPCA
1997
IEEE
15 years 8 months ago
Design Issues and Tradeoffs for Write Buffers
Processors with write-through caches typically require a write buffer to hide the write latency to the next level of memory hierarchy and to reduce write traffic. A write buffer ...
Kevin Skadron, Douglas W. Clark
141
Voted
CVPR
1996
IEEE
15 years 8 months ago
A Space-Sweep Approach to True Multi-Image Matching
The problem of determining feature correspondences across multiple views is considered. The term true multi-image" matching is introduced to describe techniques that make ful...
Robert T. Collins
BIRTHDAY
1997
Springer
15 years 8 months ago
Controlled Fuzzy Parallel Rewriting
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzz...
Peter R. J. Asveld
125
Voted
CRYPTO
1997
Springer
128views Cryptology» more  CRYPTO 1997»
15 years 8 months ago
Collision-Resistant Hashing: Towards Making UOWHFs Practical
ded abstract of this paper appears in Advances in Cryptology { Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997. This is th...
Mihir Bellare, Phillip Rogaway
123
Voted
FOCS
1990
IEEE
15 years 7 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski