443 search results - page 27 / 89 » More on the Size of Higman-Haines Sets: Effective Constructi... |
ADBIS
2009
Springer
14 years 2 months ago
2009
Springer
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
QSIC
2003
IEEE
14 years 25 days ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
TIP
1998
13 years 7 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
TIT
2011
13 years 2 months ago
2011
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...