Sciweavers

2440 search results - page 425 / 488
» Data-Intensive Question Answering
Sort
View
RTA
2010
Springer
15 years 10 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
FOCS
2004
IEEE
15 years 10 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
PODC
2010
ACM
15 years 8 months ago
On the computational power of oblivious robots: forming a series of geometric patterns
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...
Shantanu Das, Paola Flocchini, Nicola Santoro, Mas...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
IJCAI
2007
15 years 7 months ago
A Flexible Unsupervised PP-Attachment Method Using Semantic Information
In this paper we revisit the classical NLP problem of prepositional phrase attachment (PPattachment). Given the pattern V −NP1−P −NP2 in the text, where V is verb, NP1 is a ...
Srinivas Medimi, Pushpak Bhattacharyya