Sciweavers

256 search results - page 10 / 52
» Short trees in polygons
Sort
View
ICDIM
2008
IEEE
14 years 3 months ago
Sentence compression by structural conversion of parse tree
Sentence compression is the task of generating a grammatical short sentence from an original sentence, retaining important information. The existing methods of only removing the c...
Seiji Egawa, Yoshihide Kato, Shigeki Matsubara
ICFP
2005
ACM
14 years 8 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
14 years 3 months ago
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
Benoît Libert, Moti Yung
BMCBI
2008
123views more  BMCBI 2008»
13 years 8 months ago
A tree-based conservation scoring method for short linear motifs in multiple alignments of protein sequences
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
Claudia Chica, Alberto Labarga, Cathryn M. Gould, ...
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 3 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr