Sciweavers

1679 search results - page 200 / 336
» Strong order equivalence
Sort
View
JOC
2006
69views more  JOC 2006»
13 years 9 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
JFP
2000
163views more  JFP 2000»
13 years 8 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
IANDC
2010
141views more  IANDC 2010»
13 years 7 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
13 years 7 months ago
Leader Election Problem versus Pattern Formation Problem
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
Yoann Dieudonné, Franck Petit, Vincent Vill...
CVPR
2008
IEEE
14 years 11 months ago
Action recognition using exemplar-based embedding
In this paper, we address the problem of representing human actions using visual cues for the purpose of learning and recognition. Traditional approaches model actions as space-ti...
Daniel Weinland, Edmond Boyer