Sciweavers

1284 search results - page 88 / 257
» Data Structures for Mergeable Trees
Sort
View
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 12 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
CVPR
2012
IEEE
11 years 10 months ago
Road network extraction from airborne LiDAR data using scene context
We presented a novel procedure to extract ground road networks from airborne LiDAR data. First point clouds were separated into ground and non-ground parts, and ground roads were ...
Jiaping Zhao, Suya You
PR
2010
147views more  PR 2010»
13 years 6 months ago
Minimum classification error learning for sequential data in the wavelet domain
Wavelet analysis has found widespread use in signal processing and many classification tasks. Nevertheless, its use in dynamic pattern recognition have been much more restricted ...
D. Tomassi, Diego H. Milone, L. Forzani
ICIP
2010
IEEE
13 years 5 months ago
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
Yingsong Zhang, Nick G. Kingsbury
HASKELL
2008
ACM
13 years 8 months ago
Clase: cursor library for a structured editor
The “zipper” is a well known design pattern for providing a cursorlike interface to a data structure. However, the classic treatise by Huet only scratches the surface of some ...
Tristan O. R. Allwood, Susan Eisenbach