Sciweavers

1918 search results - page 181 / 384
» Discovering Cortical Algorithms
Sort
View
ICDM
2003
IEEE
100views Data Mining» more  ICDM 2003»
15 years 10 months ago
Tractable Group Detection on Large Link Data Sets
Discovering underlying structure from co-occurrence data is an important task in a variety of fields, including: insurance, intelligence, criminal investigation, epidemiology, hu...
Jeremy Kubica, Andrew W. Moore, Jeff G. Schneider
134
Voted
CHES
1999
Springer
91views Cryptology» more  CHES 1999»
15 years 9 months ago
A High-Performance Flexible Architecture for Cryptography
Cryptographic algorithms are more efficiently implemented in custom hardware than in software running on general-purpose processors. However, systems which use hardware implementat...
R. Reed Taylor, Seth Copen Goldstein
AOSD
2007
ACM
15 years 9 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
CIKM
2006
Springer
15 years 8 months ago
Text classification improved through multigram models
Classification algorithms and document representation approaches are two key elements for a successful document classification system. In the past, much work has been conducted to...
Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng Chen
129
Voted
EUROCRYPT
2006
Springer
15 years 8 months ago
Symplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguye...