Sciweavers

3731 search results - page 127 / 747
» cases 2006
Sort
View
NN
2006
Springer
108views Neural Networks» more  NN 2006»
15 years 6 months ago
Performance analysis of LVQ algorithms: A statistical physics approach
Learning vector quantization (LVQ) constitutes a powerful and intuitive method for adaptive nearest prototype classification. However, original LVQ has been introduced based on he...
Anarta Ghosh, Michael Biehl, Barbara Hammer
IJON
1998
158views more  IJON 1998»
15 years 6 months ago
Bayesian Kullback Ying-Yang dependence reduction theory
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
Lei Xu
COCO
2006
Springer
89views Algorithms» more  COCO 2006»
15 years 10 months ago
Hardness of the Covering Radius Problem on Lattices
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
Ishay Haviv, Oded Regev
AIL
2006
90views more  AIL 2006»
15 years 6 months ago
Deontic logics for prioritized imperatives
When a conflict of duties arises, a resolution is often sought by determining an ordering of priority or importance. This paper examines how such a conflict resolution works, compa...
Jörg Hansen
COMPGEOM
2006
ACM
16 years 12 days ago
On the maximum number of edges in topological graphs with no four pairwise crossing edges
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
Eyal Ackerman