Sciweavers

426 search results - page 63 / 86
» Run lengths and liquidity
Sort
View
TIT
2002
107views more  TIT 2002»
13 years 9 months ago
Constrained systems with unconstrained positions
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...
Jorge Campello de Souza, Brian H. Marcus, Richard ...
MTA
2007
111views more  MTA 2007»
13 years 9 months ago
Story creation from heterogeneous data sources
There are numerous applications where there is a need to rapidly infer a story about a given subject from a given set of potentially heterogeneous data sources. In this paper, we f...
Marat Fayzullin, V. S. Subrahmanian, Massimiliano ...
INTEGRATION
2008
127views more  INTEGRATION 2008»
13 years 8 months ago
A Viterbi decoder architecture for a standard-agile and reprogrammable transceiver
This paper presents a Viterbi Decoder (VD) architecture for a programmable data transmission system, implemented using a Field Programmable Gate Array (FPGA) device. This VD has b...
Lucia Bissi, Pisana Placidi, Giuseppe Baruffa, And...
SPIRE
2010
Springer
13 years 8 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
13 years 8 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...