Sciweavers

674 search results - page 71 / 135
» Arguments and Results
Sort
View
COLING
2010
13 years 3 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
ACL
2011
13 years 11 days ago
A Bayesian Model for Unsupervised Semantic Parsing
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
Ivan Titov, Alexandre Klementiev
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
12 years 4 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
BIRTHDAY
2009
Springer
13 years 9 months ago
Towards the Automatic Acquisition of a Valence Dictionary for Polish
This article presents the evaluation of a valence dictionary for Polish produced with the help of shallow parsing techniques and compares those results to earlier results involving...
Adam Przepiórkowski
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 8 days ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson