Sciweavers

3378 search results - page 293 / 676
» A universe of binding and computation
Sort
View
ACL
2010
15 years 4 months ago
The Importance of Rule Restrictions in CCG
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...
Marco Kuhlmann, Alexander Koller, Giorgio Satta
DLT
2009
15 years 4 months ago
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
Makoto Kanazawa
HCI
2009
15 years 4 months ago
An Empirical Analysis of Personal Digital Document Structures
Hierarchies have long been used as useful structuring mechanisms for organizing and managing documents. This study looks at the problem of personal digital document management in t...
Sarah Henderson, Ananth Srinivasan
NAR
2011
223views Computer Vision» more  NAR 2011»
14 years 9 months ago
KUPS: constructing datasets of interacting and non-interacting protein pairs with associated attributions
KUPS (The University of Kansas Proteomics Service) provides high-quality protein–protein interaction (PPI) data for researchers developing and evaluating computational models fo...
Xue-wen Chen, Jong Cheol Jeong, Patrick Dermyer
218
Voted
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass