Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
MST
2002
128views more  MST 2002»
12 years 1 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
CONNECTION
2004
94views more  CONNECTION 2004»
12 years 1 months ago
Evolving internal memory for T-maze tasks in noisy environments
In autonomous agent systems, internal memory can be an important element to overcome the limitations of purely reactive agent behaviour. This paper presents an analysis of memory r...
DaeEun Kim
FTTCS
2006
132views more  FTTCS 2006»
12 years 1 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
CORR
2006
Springer
98views Education» more  CORR 2006»
12 years 1 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
12 years 5 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
12 years 5 months ago
Memory analysis and significance test for agent behaviours
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
DaeEun Kim
PODS
2007
ACM
108views Database» more  PODS 2007»
13 years 1 months ago
Machine models and lower bounds for query processing
This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where...
Nicole Schweikardt
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
13 years 2 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
books