Sciweavers

2128 search results - page 97 / 426
» A general characterization of indulgence
Sort
View
LOGCOM
2007
92views more  LOGCOM 2007»
15 years 4 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
APAL
2004
111views more  APAL 2004»
15 years 4 months ago
Concept lattices and order in fuzzy logic
The theory of concept lattices (i.e. hierarchical structures of concepts in the sense of Port-Royal school) is approached from the point of view of fuzzy logic. The notions of par...
Radim Belohlávek
ITA
2000
15 years 4 months ago
On a paper by Castelli, Mignosi, Restivo
Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce...
Jacques Justin
SIAMJO
2000
61views more  SIAMJO 2000»
15 years 4 months ago
Stability of Locally Optimal Solutions
: Necessary and sufficient conditions are obtained for the Lipschitzian stability of local solutions to finite-dimensional parameterized optimization problems in a very general set...
A. B. Levy, R. A. Poliquin, R. Tyrell Rockafellar
NN
2002
Springer
161views Neural Networks» more  NN 2002»
15 years 4 months ago
AANN: an alternative to GMM for pattern recognition
The objective in any pattern recognition problem is to capture the characteristics common to each class from feature vectors of the training data. While Gaussian mixture models ap...
B. Yegnanarayana, S. P. Kishore