Sciweavers

4934 search results - page 170 / 987
» complexity 2008
Sort
View
ICISC
2008
146views Cryptology» more  ICISC 2008»
15 years 6 months ago
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
Joo Yeon Cho, Miia Hermelin, Kaisa Nyberg
NIPS
2008
15 years 6 months ago
Near-minimax recursive density estimation on the binary hypercube
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
Maxim Raginsky, Svetlana Lazebnik, Rebecca Willett...
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 4 months ago
Adversary lower bounds for nonadaptive quantum algorithms
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
Pascal Koiran, Jürgen Landes, Natacha Portier...
TIT
2008
76views more  TIT 2008»
15 years 4 months ago
A Quasi-Random Approach to Space-Time Codes
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
Keying Y. Wu, Li Ping
APVIS
2008
15 years 6 months ago
Energy-Based Hierarchical Edge Clustering of Graphs
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
Hong Zhou, Xiaoru Yuan, Weiwei Cui, Huamin Qu, Bao...