3946 search results - page 105 / 790 » The computational complexity of choice sets |
266
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
173
click to vote
ICIAR
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we introduce a new multiscale representation for 2-D images named the Inter-Coefficient Product (ICP). The ICP is a decimated pyramid of complex values based on the ...
205
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
201
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian input on a block Rayleigh-...