Sciweavers

4155 search results - page 46 / 831
» External Memory Algorithms
Sort
View
PPOPP
2009
ACM
14 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
USENIX
1990
13 years 11 months ago
A New Design for Distributed Systems: The Remote Memory Model
This paper describes a new model for constructing distributed systems called the Remote Memory Model. The remote memory model consists of several client machines, one or more dedi...
Douglas Comer, Jim Griffioen
FLAIRS
2007
14 years 11 days ago
A Generic Memory Module for Events
Intelligent systems need to store their experience so that it can be reused. A memory for such systems needs to efficiently organize and search previous experience and to retriev...
Dan Tecuci, Bruce W. Porter
ICALP
2009
Springer
14 years 10 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
ACL
2003
13 years 11 months ago
Self-Organizing Markov Models and Their Application to Part-of-Speech Tagging
This paper presents a method to develop a class of variable memory Markov models that have higher memory capacity than traditional (uniform memory) Markov models. The structure of...
Jin-Dong Kim, Hae-Chang Rim, Jun-ichi Tsujii