Sciweavers

164 search results - page 16 / 33
» Improved upper bounds on sizes of codes
Sort
View
CORR
2007
Springer
91views Education» more  CORR 2007»
14 years 9 months ago
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
Junsheng Han, Paul H. Siegel, Ron M. Roth
STACS
2005
Springer
15 years 2 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
DM
2002
116views more  DM 2002»
14 years 9 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
COMPGEOM
2009
ACM
15 years 4 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan