Sciweavers

1732 search results - page 51 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
15 years 7 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
MEDIAFORENSICS
2010
15 years 7 months ago
Better security levels for broken arrows
This paper considers the security aspect of the robust zero-bit watermarking technique `Broken Arrows'(BA),1 which was invented and tested for the international challenge BOW...
Fuchun Xie, Teddy Furon, Caroline Fontaine
CDC
2009
IEEE
104views Control Systems» more  CDC 2009»
15 years 11 months ago
Minimization of length and curvature on planar curves
Abstract— In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional R √ 1 + K2 ds, depending both on le...
Ugo V. Boscain, Gregoire Charlot, Francesco Rossi
EJC
2007
15 years 6 months ago
The structure of 3-connected matroids of path width three
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek...
Rhiannon Hall, James G. Oxley, Charles Semple
JCO
2007
97views more  JCO 2007»
15 years 6 months ago
Restricted domination parameters in graphs
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
Wayne Goddard, Michael A. Henning