Sciweavers

99 search results - page 1 / 20
» Single-Pass List Partitioning
Sort
View
CISIS
2008
IEEE
13 years 11 months ago
Single-Pass List Partitioning
Parallel algorithms divide computation among several threads. In many cases, the input must also be divided. Consider an input consisting of a linear sequence of elements whose le...
Leonor Frias, Johannes Singler, Peter Sanders
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 4 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
FUZZIEEE
2007
IEEE
13 years 11 months ago
Single Pass Fuzzy C Means
— Recently several algorithms for clustering large data sets or streaming data sets have been proposed. Most of them address the crisp case of clustering, which cannot be easily ...
Prodip Hore, Lawrence O. Hall, Dmitry B. Goldgof
VLDB
1995
ACM
89views Database» more  VLDB 1995»
13 years 8 months ago
OODB Bulk Loading Revisited: The Partitioned-List Approach
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
Janet L. Wiener, Jeffrey F. Naughton
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 4 months ago
An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
Cyril Prissette