Sciweavers

92 search results - page 12 / 19
» Online Data Structures in External Memory
Sort
View
CF
2006
ACM
15 years 5 months ago
Exploiting locality to ameliorate packet queue contention and serialization
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
Sailesh Kumar, John Maschmeyer, Patrick Crowley
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
15 years 1 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...
DCC
2008
IEEE
15 years 11 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
DATAMINE
2008
95views more  DATAMINE 2008»
14 years 10 months ago
A dynamic bibliometric model for identifying online communities
Predictive modelling of online dynamic user-interaction recordings and community identifi cation from such data b ecomes more and more imp ortant w ith th e w idesp read use of on...
Xin Wang, Ata Kabán
EJC
2009
14 years 9 months ago
From Word Form Surfaces to Communication
The starting point of this paper is the external surface of a word form, for example the agent-external acoustic perturbations constituting a language sign in speech or the dots o...
Roland Hausser