Sciweavers

192 search results - page 29 / 39
» Time and Information in Sequential and Concurrent Computatio...
Sort
View
POPL
2004
ACM
15 years 12 months ago
Asynchronous and deterministic objects
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
Denis Caromel, Ludovic Henrio, Bernard P. Serpette
ECAI
2004
Springer
15 years 5 months ago
Automatic Recognition of Famous Artists by Machine
The paper addresses the question whether it is possible for a machine to learn to distinguish and recognise famous musicians (concert pianists), based on their style of playing. We...
Gerhard Widmer, Patrick Zanon
104
Voted
FOCS
2010
IEEE
14 years 9 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
99
Voted
JAIR
2006
134views more  JAIR 2006»
14 years 11 months ago
Multi-Issue Negotiation with Deadlines
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
93
Voted
CPM
2006
Springer
112views Combinatorics» more  CPM 2006»
15 years 3 months ago
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren...