Sciweavers

3898 search results - page 19 / 780
» On the Bit Extraction Problem
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
14 years 9 months ago
Bits through ARQs
We study a problem motivated by cognitive radio in which the primary is a packet system that employs ARQ feedback. A secondary system is allowed to transmit in the same frequency b...
Krishnan Eswaran, Michael Gastpar, Kannan Ramchand...
JHSN
2000
92views more  JHSN 2000»
14 years 9 months ago
On a class of time varying shapers with application to the renegotiable variable bit rate service
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...
Silvia Giordano
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
CAV
2007
Springer
116views Hardware» more  CAV 2007»
15 years 3 months ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill
JMLR
2010
172views more  JMLR 2010»
14 years 4 months ago
Modeling annotator expertise: Learning when everybody knows a bit of something
Supervised learning from multiple labeling sources is an increasingly important problem in machine learning and data mining. This paper develops a probabilistic approach to this p...
Yan Yan, Rómer Rosales, Glenn Fung, Mark W....