Sciweavers

441 search results - page 62 / 89
» A Method for Proving Observational Equivalence
Sort
View
TCS
2010
13 years 7 months ago
Itineraries of rigid rotations and diffeomorphisms of the circle
We examine the itinerary of 0 ∈ S1 = R/Z under the rotation by α ∈ R\Q. The motivating question is: if we are given only the itinerary of 0 relative to I ⊂ S1 , a finite un...
David Richeson, Paul Winkler, Jim Wiseman
AFRICACRYPT
2009
Springer
14 years 25 days ago
Certified Encryption Revisited
The notion of certified encryption had recently been suggested as a suitable setting for analyzing the security of encryption against adversaries that tamper with the key-registrat...
Pooya Farshim, Bogdan Warinschi
IANDC
2006
121views more  IANDC 2006»
13 years 8 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
IPL
2007
105views more  IPL 2007»
13 years 8 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
MICCAI
2007
Springer
14 years 9 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...