Sciweavers

72 search results - page 13 / 15
» External Memory Algorithms for String Problems
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
ALIFE
2005
13 years 7 months ago
Material Representations: From the Genetic Code to the Evolution of Cellular Automata
We present a new definition of the concept of representation for cognitive science that is based on a study of the origin of structures that are used to store memory in evolving sy...
Luis Mateus Rocha, Wim Hordijk
SPAA
2004
ACM
14 years 27 days ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
SSD
2005
Springer
108views Database» more  SSD 2005»
14 years 28 days ago
On Trip Planning Queries in Spatial Databases
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, G...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 26 days ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...