5244 search results - page 351 / 1049 » Structural Complexity of AvgBPP |
182
click to vote
JELIA
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
174
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
211
click to vote
DL
1994
Springer
15 years 11 months ago
1994
Springer
Digital Libraries will hold huge amounts of text and other forms of information. For the collections to be maximally useful, they must be highly organized with useful indexes and ...
185
click to vote
FSE
1993
Springer
15 years 11 months ago
1993
Springer
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
177
click to vote
GRAPHITE
2007
ACM
15 years 10 months ago
2007
ACM
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...