Sciweavers

4212 search results - page 23 / 843
» On Compressible Pairings and Their Computation
Sort
View
86
Voted
AAAI
2000
15 years 1 months ago
Statistics-Based Summarization - Step One: Sentence Compression
When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one...
Kevin Knight, Daniel Marcu
96
Voted
CAD
2010
Springer
15 years 18 days ago
Pattern computation for compression garment by a physical/geometric approach
This paper addresses the problem of computing planar patterns for compression garments. In the garment industry, the compression garment has been more and more widely used to reta...
Charlie C. L. Wang, Kai Tang
78
Voted
ENTCS
2007
91views more  ENTCS 2007»
15 years 13 days ago
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
George Barmpalias, Antonio Montalbán
88
Voted
DCC
2009
IEEE
16 years 1 months ago
An Adaptive Sub-sampling Method for In-memory Compression of Scientific Data
A current challenge in scientific computing is how to curb the growth of simulation datasets without losing valuable information. While wavelet based methods are popular, they req...
Didem Unat, Theodore Hromadka III, Scott B. Baden