1449 search results - page 191 / 290 » Self-Randomized Exponentiation Algorithms |
142
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
146
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
208
click to vote
SAS
1994
Springer
15 years 10 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
180
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
173
click to vote
FLAIRS
2007
15 years 8 months ago
2007
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to pro...