Sciweavers

2577 search results - page 443 / 516
» Multimedia Question Answering
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 1 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 1 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
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 1 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 1 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
DLOG
1996
15 years 1 months ago
Can Description Logics Be Used in Real-Life Knowledge-Based Systems?
In 1995, I nished my Ph.D. project which was focused on the selection of adequate Knowledge-Representation Systems (KRSs) for research applications. When I started working at the ...
Piet-Hein Speel