Sciweavers

356 search results - page 25 / 72
» Revisiting the Paxos Algorithm
Sort
View
ECP
1997
Springer
102views Robotics» more  ECP 1997»
13 years 11 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
13 years 11 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
13 years 11 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
BMVC
2000
13 years 8 months ago
Shape from Texture: Homogeneity Revisited
The objective of this paper is to estimate the orientation of a scene plane from an uncalibrated perspective image under the assumption that the scene is coated with a homogeneous...
Antonio Criminisi, Andrew Zisserman
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 7 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled