Sciweavers

4037 search results - page 41 / 808
» Routing without ordering
Sort
View
ICML
2009
IEEE
14 years 2 months ago
Learning linear dynamical systems without sequence information
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
Tzu-Kuo Huang, Jeff Schneider
PIMRC
2008
IEEE
14 years 2 months ago
A coherent amplify-and-forward relaying demonstrator without global phase reference
ACT In this work we present a demonstrator for coherent linear amplify-and-forward (AF) relaying. Two source/destination pairs communicate with the help of three half-duplex relays...
Stefan Berger, Armin Wittneben
INFORMATICALT
2008
139views more  INFORMATICALT 2008»
13 years 7 months ago
Fingerprint Minutiae Matching without Global Alignment Using Local Structures
This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and ...
Andrej Kisel, Alexej Kochetkov, Justas Kranauskas
JDA
2007
77views more  JDA 2007»
13 years 7 months ago
Path coupling without contraction
Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where...
Magnus Bordewich, Martin E. Dyer
CONNECTION
2004
98views more  CONNECTION 2004»
13 years 7 months ago
Self-refreshing memory in artificial neural networks: learning temporal sequences without catastrophic forgetting
While humans forget gradually, highly distributed connectionist networks forget catastrophically: newly learned information often completely erases previously learned information. ...
Bernard Ans, Stephane Rousset, Robert M. French, S...