Sciweavers

26 search results - page 4 / 6
» Short Redactable Signatures Using Random Trees
Sort
View
EUROCRYPT
2010
Springer
13 years 11 months ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
CSB
2003
IEEE
110views Bioinformatics» more  CSB 2003»
13 years 11 months ago
Prokaryote Phylogeny without Sequence Alignment: From Avoidance Signature to Composition Distance
A new and essentially simple method to reconstruct prokaryotic phylogenetic trees from their complete genome data without using sequence alignment is proposed. It is based on the ...
Bailin Hao, Ji Qi
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 26 days 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
BMCBI
2008
123views more  BMCBI 2008»
13 years 6 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, ...
CAV
2011
Springer
216views Hardware» more  CAV 2011»
12 years 9 months ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song