15254 search results - page 310 / 3051 » A k |
163
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
166
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
145
click to vote
SAC
2010
ACM
15 years 5 months ago
2010
ACM
Simulated tempering (ST) is an established Markov Chain Monte Carlo (MCMC) methodology for sampling from a multimodal density π(θ). The technique involves introducing an auxilia...
181
click to vote
WDAG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
190
click to vote
JCO
2007
15 years 6 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...