1922 search results - page 269 / 385 » ie 2007 |
139
click to vote
TAMC
2007
Springer
16 years 11 days ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
179
click to vote
TAMC
2007
Springer
16 years 11 days ago
2007
Springer
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
146
click to vote
TAMC
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
172
click to vote
TARK
2007
Springer
16 years 11 days ago
2007
Springer
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
179
click to vote
UCS
2007
Springer
16 years 11 days ago
2007
Springer
In this paper, we describe a packet data size minimization method designed specifically for advertising and discovery in ubiquitous networks. The minimization is effective for achi...