986 search results - page 85 / 198 » Generalized Goal Programming: polynomial methods and applica... |
TCC
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
AVSS
2005
IEEE
14 years 2 months ago
2005
IEEE
The performance of computer vision systems for measurement, surveillance, reconstruction, gait recognition, and many other applications, depends heavily on the placement of camera...
ASPLOS
1992
ACM
14 years 1 months ago
1992
ACM
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
APL
1993
ACM
14 years 1 months ago
1993
ACM
Array morphology is the study of the form, structure, and evolution of arrays. An array annotation for a program written in an applicative array lanan abstract syntax tree for the...