Sciweavers

2634 search results - page 20 / 527
» Faster Than Uppaal
Sort
View
CHI
2002
ACM
14 years 7 months ago
Effects of structure and label ambiguity on information navigation
We present experimental results showing that search for target items in a three-tiered categorization structure (approximately 8 links per page) is faster than a comparable two-ti...
Craig S. Miller, Roger W. Remington
SLP
1993
117views more  SLP 1993»
13 years 8 months ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 10 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
MICRO
2002
IEEE
173views Hardware» more  MICRO 2002»
14 years 12 days ago
Vector vs. superscalar and VLIW architectures for embedded multimedia benchmarks
Multimedia processing on embedded devices requires an architecture that leads to high performance, low power consumption, reduced design complexity, and small code size. In this p...
Christoforos E. Kozyrakis, David A. Patterson
PQCRYPTO
2010
152views Cryptology» more  PQCRYPTO 2010»
13 years 11 months ago
Grover vs. McEliece
This paper shows that quantum information-set-decoding attacks are much faster than non-quantum information-set-decoding attacks.
Daniel J. Bernstein