Sciweavers

1170 search results - page 136 / 234
» How Fast Is Too Fast
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 3 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
MST
2002
128views more  MST 2002»
15 years 3 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
SAC
2002
ACM
15 years 3 months ago
Decision tree classification of spatial data streams using Peano Count Trees
Many organizations have large quantities of spatial data collected in various application areas, including remote sensing, geographical information systems (GIS), astronomy, compu...
Qiang Ding, Qin Ding, William Perrizo
174
Voted
SOCO
2010
Springer
15 years 1 months ago
Automatic detection of trends in time-stamped sequences: an evolutionary approach
This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal artic...
Lourdes Araujo, Juan Julián Merelo Guerv&oa...
138
Voted
MICRO
2010
IEEE
172views Hardware» more  MICRO 2010»
15 years 1 months ago
Architectural Support for Fair Reader-Writer Locking
Abstract--Many shared-memory parallel systems use lockbased synchronization mechanisms to provide mutual exclusion or reader-writer access to memory locations. Software locks are i...
Enrique Vallejo, Ramón Beivide, Adriá...