Sciweavers

1567 search results - page 104 / 314
» Compressing Relations and Indexes
Sort
View
ACL
2010
13 years 7 months ago
Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution grammar (STSG) for monolingual translation tasks such as sentence compression a...
Elif Yamangil, Stuart M. Shieber
ISITA
2010
13 years 7 months ago
Using synchronization bits to boost compression by substring enumeration
A new lossless data compression technique called compression via substring enumeration (CSE) has recently been introduced. It has been observed that CSE achieves lower performance ...
Danny Dubé
LPAR
2010
Springer
13 years 7 months ago
Automated Proof Compression by Invention of New Definitions
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
Jirí Vyskocil, David Stanovský, Jose...
ICASSP
2011
IEEE
13 years 28 days ago
Detection and removal of binocular luster in compressed 3D images
Binocular luster is an extremely salient effect seen in 3D when an object in each stereo image exhibits a different contrast polarity relative to the background. The object appear...
Can Bal, Ankit K. Jain, Truong Q. Nguyen
FAST
2009
13 years 7 months ago
Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality
We present sparse indexing, a technique that uses sampling and exploits the inherent locality within backup streams to solve for large-scale backup (e.g., hundreds of terabytes) t...
Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, ...