Sciweavers

140 search results - page 9 / 28
» Doing More with Fewer Bits
Sort
View
NIPS
2001
13 years 8 months ago
Generalizable Relational Binding from Coarse-coded Distributed Representations
We present a model of binding of relationship information in a spatial domain (e.g., square above triangle) that uses low-order coarse-coded conjunctive representations instead of...
Randall C. O'Reilly, R. S. Busby
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
WEBNET
1996
13 years 8 months ago
Information fusion with ProFusion
: The explosive growth of the World Wide Web, and the resulting information overload, has led to a miniexplosion in World Wide Web search engines. This mini-explosion, in turn, led...
Susan Gauch, Guijun Wang
PKC
2005
Springer
102views Cryptology» more  PKC 2005»
14 years 1 months ago
Experimenting with Faults, Lattices and the DSA
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques. This seems to be the first (publicly reported) physical experimen...
David Naccache, Phong Q. Nguyen, Michael Tunstall,...
ESEM
2007
ACM
13 years 11 months ago
A Replicate Empirical Comparison between Pair Development and Software Development with Inspection
In 2005, we studied the development effort and effect of quality comparisons between software development with Fagan's inspection and pair development. Three experiments were...
Monvorath Phongpaibul, Barry W. Boehm