Sciweavers

1028 search results - page 134 / 206
» Character sets of strings
Sort
View
PKC
2010
Springer
118views Cryptology» more  PKC 2010»
13 years 11 months ago
Text Search Protocols with Simulation Based Security
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen
EMNLP
2008
13 years 11 months ago
Generalizing Local and Non-Local Word-Reordering Patterns for Syntax-Based Machine Translation
Syntactic word reordering is essential for translations across different grammar structures between syntactically distant languagepairs. In this paper, we propose to embed local a...
Bing Zhao, Yaser Al-Onaizan
FCS
2006
13 years 11 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith
CLIN
2001
13 years 11 months ago
Corpus-based Acquisition of Collocational Prepositional Phrases
Collocational prepositional phrases like ten koste van (at the expense of), met het oog op (with an eye on), and onder het mom van (under the pretext of) are patterns of the form ...
Gosse Bouma, Begoña Villada
JSYML
2006
86views more  JSYML 2006»
13 years 9 months ago
Degrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
William C. Calhoun