Sciweavers

297 search results - page 43 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
CSL
2004
Springer
15 years 6 months ago
Automatic capitalisation generation for speech input
Two different systems are proposed for the task of capitalisation generation. The first system is a slightly modified speech recogniser. In this system, every word in the vocabula...
Ji-Hwan Kim, Philip C. Woodland
CORR
2008
Springer
157views Education» more  CORR 2008»
15 years 6 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 2 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Xuan-Chao Huang, Jay Cheng
WCNC
2008
IEEE
16 years 14 days ago
Optimal Strategies for Cooperative MAC-Layer Retransmission in Wireless Networks
—The concept of cooperative retransmission in wireless networks has attracted considerable research attention. The basic idea is that when a receiver cannot decode a frame, the r...
Lixiang Xiong, Lavy Libman, Guoqiang Mao
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams