Sciweavers

3256 search results - page 251 / 652
» Learning Linear Transformations
Sort
View
GECCO
2004
Springer
138views Optimization» more  GECCO 2004»
15 years 12 months ago
Exploratory Data Analysis with Interactive Evolution
We illustrate with two simple examples how Interactive Evolutionary Computation (IEC) can be applied to Exploratory Data Analysis (EDA). IEC is particularly valuable in an EDA cont...
Sergey Malinchik, Eric Bonabeau
CSFW
1999
IEEE
15 years 11 months ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
NIPS
2007
15 years 8 months ago
Compressed Regression
Recent research has studied the role of sparsity in high dimensional regression and signal reconstruction, establishing theoretical limits for recovering sparse models from sparse...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
DM
2010
77views more  DM 2010»
15 years 6 months ago
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
Stasys Jukna
ADCM
1998
133views more  ADCM 1998»
15 years 6 months ago
Numerical exploitation of symmetry in integral equations
: Linear integral operators describing physical problems on symmetric domains often are equivariant, which means that they commute with certain symmetries, i.e., with a group of or...
Eugene L. Allgower, Kurt Georg