4255 search results - page 120 / 851 » Cover |
118
click to vote
DCC
2001
IEEE
16 years 3 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
127
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
130
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Without any assumption on the cover source, this paper presents a complete characterization of all perfectly secure stego-systems that employ mutually independent embedding operat...
123
click to vote
ADC
2009
Springer
15 years 10 months ago
2009
Springer
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which dete...
124
click to vote
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...