Sciweavers

1278 search results - page 181 / 256
» The Complexity of Weighted Boolean
Sort
View
PRL
2002
95views more  PRL 2002»
13 years 10 months ago
Dissimilarity representations allow for building good classifiers
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the neares...
Elzbieta Pekalska, Robert P. W. Duin
TNN
1998
112views more  TNN 1998»
13 years 10 months ago
A class of competitive learning models which avoids neuron underutilization problem
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
Clifford Sze-Tsan Choy, Wan-Chi Siu
LATINCRYPT
2010
13 years 8 months ago
How Leaky Is an Extractor?
This paper discusses the security of a leakage-resilient stream cipher presented at FOCS 2008, instantiated in a practical setting. Based on a case study, we put forward implementa...
François-Xavier Standaert
NECO
2010
129views more  NECO 2010»
13 years 8 months ago
A Two-Layer Model of Natural Stimuli Estimated with Score Matching
We consider a hierarchical two-layer model of natural signals in which both layers are learned from the data. Estimation is accomplished by Score Matching, a recently proposed est...
Urs Köster, Aapo Hyvärinen
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 8 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani