Sciweavers

1512 search results - page 86 / 303
» connection 2006
Sort
View
DCC
2006
IEEE
15 years 9 months ago
Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...
Michelle Effros, Muriel Médard, Todd P. Col...
IJFCS
2010
60views more  IJFCS 2010»
14 years 8 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (Ï...
Andreas Maletti, Catalin Ionut Tîrnauca
DLT
2006
14 years 11 months ago
Can Abstract State Machines Be Useful in Language Theory?
ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
Yuri Gurevich, Charles Wallace
CONNECTION
2006
172views more  CONNECTION 2006»
14 years 9 months ago
Temporal sequence detection with spiking neurons: towards recognizing robot language instructions
We present an approach for recognition and clustering of spatio temporal patterns based on networks of spiking neurons with active dendrites and dynamic synapses. We introduce a n...
Christo Panchev, Stefan Wermter
IJDAR
2000
77views more  IJDAR 2000»
14 years 9 months ago
Symbol and character recognition: application to engineering drawings
: In this paper, we consider the general problem of technical document interpretation, applied to the documents of the French Telephonic Operator, France Telecom. More precisely, w...
Sébastien Adam, Jean-Marc Ogier, Claude Car...