Sciweavers

845 search results - page 65 / 169
» Complexity Dimensions and Learnability
Sort
View
ICPP
1994
IEEE
15 years 4 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
141
Voted
COLT
2000
Springer
15 years 4 months ago
The Role of Critical Sets in Vapnik-Chervonenkis Theory
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
Nicolas Vayatis
112
Voted
FSE
2009
Springer
107views Cryptology» more  FSE 2009»
15 years 7 months ago
Multidimensional Extension of Matsui's Algorithm 2
Matsui’s one-dimensional Alg. 2 can be used for recovering bits of the last round key of a block cipher. In this paper a truly multidimensional extension of Alg. 2 based on estab...
Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg
73
Voted
MFCS
2007
Springer
15 years 7 months ago
Reachability Problems in Quaternion Matrix and Rotation Semigroups
Abstract. We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is s...
Paul Bell, Igor Potapov
96
Voted
COCOON
1998
Springer
15 years 5 months ago
On Multi-dimensional Hilbert Indexings
Indexing schemes for grids based on space- lling curves (e.g., Hilbert indexings) nd applications in numerous elds. Hilbert curves yield the most simple and popular scheme. We exte...
Jochen Alber, Rolf Niedermeier