Sciweavers

4263 search results - page 71 / 853
» Learning without Coding
Sort
View
KBSE
2009
IEEE
15 years 8 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
CICLING
2004
Springer
15 years 5 months ago
Korean Compound Noun Decomposition Using Syllabic Information Only
The compound nouns are freely composed in Korean, since it is possible to concatenate independent nouns without a postposition. Therefore, the systems that handle compound nouns su...
Seong-Bae Park, Jeong Ho Chang, Byoung-Tak Zhang
ICA
2010
Springer
15 years 2 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
ICML
2009
IEEE
16 years 2 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
95
Voted
NN
1998
Springer
15 years 1 months ago
Distributed ARTMAP: a neural network for fast distributed supervised learning
Distributed coding at the hidden layer of a multi-layer perceptron (MLP) endows the network with memory compression and noise tolerance capabilities. However, an MLP typically req...
Gail A. Carpenter, Boriana L. Milenova, Benjamin W...