3708 search results - page 308 / 742 » The Inverse Classification Problem |
174
click to vote
ENDM
2010
15 years 7 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
165
click to vote
PRL
2006
15 years 7 months ago
2006
In this work we introduce a new distance estimation technique by boosting and we apply it to the K-Nearest Neighbor Classifier (KNN). Instead of applying AdaBoost to a typical cla...
172
click to vote
JSYML
2000
15 years 7 months ago
2000
We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations clo...
180
click to vote
IJON
2002
15 years 6 months ago
2002
: A new supervised learning procedure for training RBF networks is proposed. It uses a pair of parallel running Kalman filters to sequentially update both the output weights and th...
211
Voted
PODS
2010
ACM
16 years 7 days ago
2010
ACM
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...