Sciweavers

3607 search results - page 690 / 722
» Learning with structured sparsity
Sort
View
138
Voted
NN
2002
Springer
115views Neural Networks» more  NN 2002»
15 years 1 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
118
Voted
TNN
1998
121views more  TNN 1998»
15 years 1 months ago
Detection of mines and minelike targets using principal component and neural-network methods
— This paper introduces a new system for real-time detection and classification of arbitrarily scattered surface-laid mines from multispectral imagery data of a minefield. The ...
Xi Miao, Mahmood R. Azimi-Sadjadi, Bin Tan, A. C. ...
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 1 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
INFOCOM
2010
IEEE
15 years 9 days ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
105
Voted
IPL
2010
98views more  IPL 2010»
15 years 9 days ago
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...
Nathan Keller, Stephen D. Miller