412 search results - page 75 / 83 » A New Proof of the F5 Algorithm |
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...
185
click to vote
POPL
2009
ACM
16 years 9 days ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
91
Voted
EUROCRYPT
2009
Springer
16 years 7 days ago
2009
Springer
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
114
click to vote
COCO
1994
Springer
15 years 3 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...