Sciweavers

168 search results - page 24 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 1 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
Constant-Weight Gray Codes for Local Rank Modulation
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The local rankmodulation, ...
Moshe Schwartz
DM
2010
114views more  DM 2010»
13 years 8 months ago
Remarks on a generalization of the Davenport constant
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
Michael Freeze, Wolfgang A. Schmid
STOC
1993
ACM
87views Algorithms» more  STOC 1993»
14 years 2 days ago
How to use expert advice
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
Nicolò Cesa-Bianchi, Yoav Freund, David P. ...
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...