Sciweavers

675 search results - page 71 / 135
» On Compression of Parse Trees
Sort
View
WWW
2006
ACM
14 years 9 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
DCC
2009
IEEE
14 years 3 months ago
Tree Histogram Coding for Mobile Image Matching
For mobile image matching applications, a mobile device captures a query image, extracts descriptive features, and transmits these features wirelessly to a server. The server reco...
David M. Chen, Sam S. Tsai, Vijay Chandrasekhar, G...
DCC
2010
IEEE
14 years 3 months ago
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
Simon Gog, Johannes Fischer
ACL
2008
13 years 10 months ago
A Generic Sentence Trimmer with CRFs
The paper presents a novel sentence trimmer in Japanese, which combines a non-statistical yet generic tree generation model and Conditional Random Fields (CRFs), to address improv...
Tadashi Nomoto
IJFCS
2006
108views more  IJFCS 2006»
13 years 8 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth