Sciweavers

1079 search results - page 30 / 216
» An Implementation of an Address Generator Using Hash Memorie...
Sort
View
EMNLP
2010
13 years 7 months ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple
FASE
2006
Springer
14 years 21 days ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...
CJ
2002
67views more  CJ 2002»
13 years 8 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
ASPLOS
1991
ACM
14 years 16 days ago
Code Generation for Streaming: An Access/Execute Mechanism
Access/execute architectures have several advantages over more traditional architectures. Because address generation and memory access are decoupled from operand use, memory laten...
Manuel E. Benitez, Jack W. Davidson
ISCAS
2006
IEEE
113views Hardware» more  ISCAS 2006»
14 years 3 months ago
High speed routing lookup IC design for IPv6
— With the growth of Internet users and services, the IP address has been exhausted. In order to solve this problem, the short term solution was presented, i.e., CIDR (Classless ...
Yuan-Sun Chu, Hui-Kai Su, Po-Feng Lin, Ming-Jen Ch...