Sciweavers

2436 search results - page 51 / 488
» Comonadic Notions of Computation
Sort
View
EUROCRYPT
2008
Springer
13 years 11 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
TCS
2008
13 years 9 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
AI
2008
Springer
13 years 9 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...
DCC
2004
IEEE
14 years 9 months ago
Semi-Lossless Text Compression
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...
Yair Kaufman, Shmuel T. Klein
BIRTHDAY
2009
Springer
14 years 4 months ago
Mobile Processes and Termination
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...