Sciweavers

4218 search results - page 527 / 844
» Complete sets of cooperations
Sort
View
SPAA
2009
ACM
16 years 1 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
133
Voted
CICLING
2007
Springer
15 years 10 months ago
Dependency Analysis and CBR to Bridge the Generation Gap in Template-Based NLG
The present paper describes how dependency analysis can be used to automatically extract from a corpus a set of cases - and an accompanying vocabulary - which enable a template-bas...
Virginia Francisco, Raquel Hervás, Pablo Ge...
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 10 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
ICALP
2005
Springer
15 years 10 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 9 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...