Sciweavers

4255 search results - page 7 / 851
» Cover
Sort
View
JCO
2010
182views more  JCO 2010»
13 years 5 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
SIAMDM
2002
84views more  SIAMDM 2002»
13 years 7 months ago
Multicovering Bounds from Relative Covering Radii
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-t...
Iiro S. Honkala, Andrew Klapper
HICSS
2009
IEEE
85views Biometrics» more  HICSS 2009»
14 years 2 months ago
Bounding the Size of k-Tuple Covers
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...
Wolfgang W. Bein, Shahram Latifi, Linda Morales, I...
ICASSP
2008
IEEE
14 years 1 months ago
Audio cover song identification based on tonal sequence alignment
Nowadays, the term cover song (or simply cover) can mean any new version, performance, rendition, or recording of a previously recorded track. Cover song identification is a task...
Joan Serrà, Emilia Gómez
CPM
2010
Springer
127views Combinatorics» more  CPM 2010»
14 years 8 days ago
Cover Array String Reconstruction
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...
Maxime Crochemore, Costas S. Iliopoulos, Solon P. ...