Sciweavers

927 search results - page 73 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
134
Voted
IACR
2011
135views more  IACR 2011»
14 years 2 months ago
Algebraic Complexity Reduction and Cryptanalysis of GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...
Nicolas Courtois
140
Voted
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 2 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
123
Voted
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
15 years 4 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
119
Voted
KER
2006
107views more  KER 2006»
15 years 2 months ago
Partitioning strategies for distributed association rule mining
In this paper a number of alternative strategies for distributed/parallel association rule mining are investigated. The methods examined make use of a data structure, the T-tree, ...
Frans Coenen, Paul H. Leng
GFKL
2005
Springer
125views Data Mining» more  GFKL 2005»
15 years 8 months ago
Towards Structure-sensitive Hypertext Categorization
Abstract. Hypertext categorization is the task of automatically assigning category labels to hypertext units. Comparable to text categorization it stays in the area of function lea...
Alexander Mehler, Rüdiger Gleim, Matthias Deh...