Sciweavers

2370 search results - page 42 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ECCC
1998
117views more  ECCC 1998»
14 years 9 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 4 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
TIFS
2010
171views more  TIFS 2010»
14 years 4 months ago
A method for automatic identification of signatures of steganography software
Abstract--A fully automated, blind, media-type agnostic approach to steganalysis is presented here. Steganography may sometimes be exposed by detecting automatically characterized ...
Graeme Bell, Yeuan-Kuen Lee
PPSN
1998
Springer
15 years 1 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
STACS
2007
Springer
15 years 3 months ago
On Symmetric Signatures in Holographic Algorithms
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmet
Jin-yi Cai, Pinyan Lu