1034 search results - page 121 / 207 » Small Pi01 Classes |
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
EUROCRYPT
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
93
Voted
ECCV
2000
Springer
15 years 3 months ago
2000
Springer
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
95
Voted
PODS
1999
ACM
15 years 3 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
FM
1994
Springer
15 years 3 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...