Sciweavers

3818 search results - page 55 / 764
» Word Problems on Compressed Words
Sort
View
167
Voted
ADBIS
2007
Springer
119views Database» more  ADBIS 2007»
16 years 16 days ago
Combining Efficient XML Compression with Query Processing
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
Przemyslaw Skibinski, Jakub Swacha
AUTOMATICA
2007
76views more  AUTOMATICA 2007»
15 years 6 months ago
Fault-tolerant compression filters by time-propagated measurement fusion
For fault-tolerant real-time filtering, an efficient two-filter architecture is proposed. In the two-filter architecture, a host filter is operated permanently. A compression filt...
Hyung Keun Lee, Jang Gyu Lee
ACL
2010
15 years 4 months ago
Finding Cognate Groups Using Phylogenies
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...
David Hall, Dan Klein
ICIP
2001
IEEE
16 years 8 months ago
Similarity measure for CCITT Group 4 compressed document images
Similarity measure of document images acts a crucial role in the area of document image retrieval. A method of measuring the similarity of CCITT Group 4 compressed document images...
Yue Lu, Chew Lim Tan, Liying Fan, Weihua Huang
MFCS
2005
Springer
15 years 12 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch