Sciweavers

112 search results - page 6 / 23
» Faster deterministic dictionaries
Sort
View
DCC
2003
IEEE
14 years 7 months ago
A Dictionary-Based Multi-Corpora Text Compression System
In this paper we introduce StarZip, a multi-corpora lossless text compression utility which incorporates StarNT, our newly proposed transform algorithm. StarNT is a dictionary-base...
Weifeng Sun, Nan Zhang 0005, Amar Mukherjee
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
14 years 1 months ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa
CVPR
2012
IEEE
11 years 10 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
BMCBI
2006
86views more  BMCBI 2006»
13 years 7 months ago
MCALIGN2: Faster, accurate global pairwise alignment of non-coding DNA sequences based on explicit models of indel evolution
Background: Non-coding DNA sequences comprise a very large proportion of the total genomic content of mammals, most other vertebrates, many invertebrates, and most plants. Unravel...
Jun Wang, Peter D. Keightley, Toby Johnson
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 1 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha