Results 1  10
of
697
Cryptanalysis of block ciphers with overdefined systems of equations
, 2002
"... Abstract. Several recently proposed ciphers, for example Rijndael and Serpent, are built with layers of small Sboxes interconnected by linear keydependent layers. Their security relies on the fact, that the classical methods of cryptanalysis (e.g. linear or differential attacks) are based on proba ..."
Abstract

Cited by 253 (22 self)
 Add to MetaCart
with the number of rounds. The XSL attack would then be polynomial (or subexponential) in Nr, with a huge constant that is doubleexponential in the size of the Sbox. The exact complexity of such attacks is not known due to the redundant equations. Though the presented version of the XSL attack always gives
A Spectral Bundle Method for Semidefinite Programming
 SIAM JOURNAL ON OPTIMIZATION
, 1997
"... A central drawback of primaldual interior point methods for semidefinite programs is their lack of ability to exploit problem structure in cost and coefficient matrices. This restricts applicability to problems of small dimension. Typically semidefinite relaxations arising in combinatorial applica ..."
Abstract

Cited by 171 (7 self)
 Add to MetaCart
applications have sparse and well structured cost and coefficient matrices of huge order. We present a method that allows to compute acceptable approximations to the optimal solution of large problems within reasonable time. Semidefinite programming problems with constant trace on the primal feasible set
Big Data: A Concept of Managing Huge Data
"... The rapid proliferation of data has lead to the necessity of big data. However the volume of big data is constantly growing. Big data comprises of extremely large data sets which are beyond the scope of management offered by commonly used software. Big Data mining can be described as a set of techni ..."
Abstract
 Add to MetaCart
The rapid proliferation of data has lead to the necessity of big data. However the volume of big data is constantly growing. Big data comprises of extremely large data sets which are beyond the scope of management offered by commonly used software. Big Data mining can be described as a set
FOREST, a Browser for Huge DNA Sequences
"... We present a new tool, FOREST, aiming at representing the content of a large nucleic acid sequence (e.g.>100KB) in a suitable form for the biologist. More precisely, FOREST builds all subsequences repeated inasequence or a set of sequences. It allows not only to look for the location of the vari ..."
Abstract
 Add to MetaCart
, computed on the set of subsequences under this node. This allows the biologist to "browse " in the sequence with a constant abstract view of what he may expect to nd in the section of the tree he is currently investigating. The second idea consists to summarize the distribution of the information
Graphs with tiny vector chromatic numbers and huge chromatic numbers
 SIAM J. COMPUT
, 2004
"... Karger, Motwani, and Sudan [J. ACM, 45 (1998), pp. 246–265] introduced the notion of a vector coloring of a graph. In particular, they showed that every kcolorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly ∆ 1−2/k colors ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Karger, Motwani, and Sudan [J. ACM, 45 (1998), pp. 246–265] introduced the notion of a vector coloring of a graph. In particular, they showed that every kcolorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly ∆ 1−2/k
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
 CISS 2006 (40th Annual Conference on Information Sciences and Systems
, 2006
"... Abstract — This paper proves best known guarantees for exact reconstruction of a sparse signal f from few nonadaptive universal linear measurements. We consider Fourier measurements (random sample of frequencies of f) and random Gaussian measurements. The method for reconstruction that has recently ..."
Abstract

Cited by 108 (7 self)
 Add to MetaCart
that the number of measurements k(r, n) needed to exactly reconstruct any rsparse signal f of length n from its linear measurements with convex relaxation is usually O(r polylog(n)). However, known guarantees involve huge constants, in spite of very good performance of the algorithms in practice. In attempt
Patch Relational Neural Gas  Clustering of Huge Dissimilarity Datasets
 in "Proceedings of the Third IAPR Workshop on Artificial Neural Networks in Pattern Recognition (ANNPR 2008
, 2008
"... Abstract. Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototypebased neural methods such as neural gas or the selforganizing map offer an intuitive and fast variant which represents data by means of typical re ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
relies on the same cost function but it dramatically reduces time and memory requirements. It offers a single pass clustering algorithm for huge data sets, running in constant space and linear time only. 1
Libra: Divide and Conquer to Verify Forwarding Tables in Huge Networks
"... Data center networks often have errors in the forwarding tables, causing packets to loop indefinitely, fall into blackholes or simply get dropped before they reach the correct destination. Finding forwarding errors is possible using static analysis, but none of the existing tools scale to a large ..."
Abstract
 Add to MetaCart
data center network with thousands of switches and millions of forwarding entries. Worse still, in a large data center network the forwarding state is constantly in flux, which makes it hard to take an accurate snapshot of the state for static analysis. We solve these problems with Libra, a new tool
1RBO Protocol: Broadcasting Huge Databases for Tiny Receivers
"... Abstract—We propose a protocol (called RBO) for broadcasting long streams of singlepacket messages over radio channel for tiny, battery powered, receivers. The messages are labeled by the keys from some linearly ordered set. The sender repeatedly broadcasts a sequence of many (possibly millions) o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
very efficiently with only constant number of dlog2 nebit variables, where n is the total number of messages in the sequence. The total number of the required receptions is at most 2dlog2 ne + 2 in the model with perfect synchronization. The basic procedure of RBO (computation of the time slot
Dual labeling: Answering graph reachability queries in constant time
 in Proc. 22nd International Conference on Data Engineering
, 2006
"... Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many applications involve huge graphs and require fast answering of reachability queries. Several reachability labeling methods ..."
Abstract

Cited by 58 (12 self)
 Add to MetaCart
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many applications involve huge graphs and require fast answering of reachability queries. Several reachability labeling methods
Results 1  10
of
697