Sciweavers

439 search results - page 34 / 88
» An Improved Analysis of Linear Mergers
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 15 days ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg
85
Voted
ICDAR
2003
IEEE
15 years 5 months ago
Towards a Ptolemaic Model for OCR
In style-constrained classification often there are only a few samples of each style and class, and the correspondences between styles in the training set and the test set are un...
Sriharsha Veeramachaneni, George Nagy
126
Voted
VTS
2005
IEEE
116views Hardware» more  VTS 2005»
15 years 6 months ago
Closed-Form Simulation and Robustness Models for SEU-Tolerant Design
— A closed-form model for simulation and analysis of voltage transients caused by single-event upsets (SEUs) in logic circuits is described. A linear RC model, derived using a SP...
Kartik Mohanram
MFCS
2005
Springer
15 years 6 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
JCSS
2008
62views more  JCSS 2008»
15 years 13 days ago
Maximal repetitions in strings
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
Maxime Crochemore, Lucian Ilie