1449 search results - page 203 / 290 » Self-Randomized Exponentiation Algorithms |
180
click to vote
CP
2000
Springer
15 years 9 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
156
click to vote
ICDT
1995
ACM
15 years 9 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
170
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
163
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
159
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...