Sciweavers

675 search results - page 55 / 135
» On Compression of Parse Trees
Sort
View
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
13 years 6 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
ICMCS
2005
IEEE
148views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Compressed Domain Image Indexing and Retrieval Based on the Minimal Spanning Tree
In this paper, a method for content-based retrieval of JPEG images is presented, utilizing features directly from the discrete cosine transform (DCT) domain. Image indexing is ach...
Christos Theoharatos, Vassilios K. Pothos, George ...
CPM
2008
Springer
117views Combinatorics» more  CPM 2008»
13 years 10 months ago
Dynamic Fully-Compressed Suffix Trees
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
CPM
2008
Springer
126views Combinatorics» more  CPM 2008»
13 years 10 months ago
An(other) Entropy-Bounded Compressed Suffix Tree
Johannes Fischer, Veli Mäkinen, Gonzalo Navar...
CIVR
2004
Springer
116views Image Analysis» more  CIVR 2004»
14 years 2 months ago
A Visual Model Approach for Parsing Colonoscopy Videos
Abstract. Colonoscopy is an important screening procedure for colorectal cancer. During this procedure, the endoscopist visually inspects the colon. Currently, there is no content-...
Yu Cao, Wallapak Tavanapong, Dalei Li, Jung-Hwan O...