588 search results - page 75 / 118 » Positive higher-order queries |
126
click to vote
ICMCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Since only simple symbol-based manipulations are needed,n-gram indexingis used for naturallanguageswhere syntactic or semantic analyses are often difficult. Music, whose automatic...
125
click to vote
CIKM
1997
Springer
15 years 8 months ago
1997
Springer
Terrain-aided navigation is a database application in which an aeroplane locates itself by matching the height trajectory with a terrain-elevation map on board the aircraft. Witho...
131
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
162
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
140
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...