Sciweavers

3172 search results - page 505 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ECOOP
2008
Springer
15 years 8 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
ACL
2008
15 years 8 months ago
Learning Bigrams from Unigrams
Traditional wisdom holds that once documents are turned into bag-of-words (unigram count) vectors, word orders are completely lost. We introduce an approach that, perhaps surprisi...
Xiaojin Zhu, Andrew B. Goldberg, Michael Rabbat, R...
LREC
2010
142views Education» more  LREC 2010»
15 years 8 months ago
Partial Parsing as a Method to Expedite Dependency Annotation of a Hindi Treebank
The paper describes an approach to expedite the process of manual annotation of a Hindi dependency treebank which is currently under development. We propose a way by which consist...
Mridul Gupta, Vineet Yadav, Samar Husain, Dipti Mi...
ICISC
2008
89views Cryptology» more  ICISC 2008»
15 years 8 months ago
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Group key agreement (GKA) allows a set of players to establish a shared secret and thus bootstrap secure group communication. GKA is very useful in many types of peer group scenar...
Jihye Kim, Gene Tsudik
ICWS
2008
IEEE
15 years 8 months ago
A Theory of Role Composition
We study the access control integration problem for web services. Organizations frequently use many services, each with its own access control policies, that must interoperate whi...
Jeffrey Fischer, Rupak Majumdar