Sciweavers

312 search results - page 37 / 63
» Indexing Gapped-Factors Using a Tree
Sort
View
JACM
2006
112views more  JACM 2006»
13 years 9 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 4 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
ICIP
2001
IEEE
14 years 11 months ago
Feature coincidence trees for registration of ultrasound breast images
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson
ICCV
2009
IEEE
15 years 2 months ago
Recognizing Actions by Shape-Motion Prototype Trees
A prototype-based approach is introduced for action recognition. The approach represents an action as a se- quence of prototypes for efficient and flexible action match- ing in ...
Zhe Lin, Zhuolin Jiang, Larry S. Davis
ICMCS
2005
IEEE
145views Multimedia» more  ICMCS 2005»
14 years 3 months ago
Error Resilient Multiple Description Coding Based on Wavelet Tree Coding and EREC for Wireless Networks
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...
Daewon Song, Lei Cao, Chang Wen Chen