Sciweavers

2722 search results - page 397 / 545
» Hastily formed networks
Sort
View
96
Voted
ICONIP
1998
15 years 2 months ago
An Application of ELISA to Perfect Hashing with Deterministic Ordering
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
Monica Bianchini, Stefano Fanelli, Marco Gori
NIPS
1994
15 years 2 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
WCE
2007
15 years 2 months ago
Wavepackets in the Recognition of Isolated Handwritten Characters
— This work is to apply wavelet packet transformation for the recognition of isolated handwritten Malayalam (one of the south Indian languages) characters. The key idea is that c...
G. Raju, K. Revathy
108
Voted
CACM
2010
113views more  CACM 2010»
15 years 1 months ago
Reasoning about the unknown in static analysis
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
Isil Dillig, Thomas Dillig, Alex Aiken
AUTOMATICA
2006
98views more  AUTOMATICA 2006»
15 years 1 months ago
Stabilization of sampled-data nonlinear systems via backstepping on their Euler approximate model
Two integrator backstepping designs are presented for digitally controlled continuous-time plants in special form. The controller designs are based on the Euler approximate discre...
Dragan Nesic, Andrew R. Teel