Sciweavers

1381 search results - page 114 / 277
» Structural signatures for tree data structures
Sort
View
ENTCS
2010
101views more  ENTCS 2010»
14 years 7 months ago
Strengthening the Zipper
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...
Tristan O. R. Allwood, Susan Eisenbach
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
14 years 11 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
15 years 11 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 11 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
BMCBI
2010
118views more  BMCBI 2010»
14 years 10 months ago
From learning taxonomies to phylogenetic learning: Integration of 16S rRNA gene data into FAME-based bacterial classification
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
Bram Slabbinck, Willem Waegeman, Peter Dawyndt, Pa...