13026 search results - page 2490 / 2606 » Probabilistic Relational Models |
125
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
We present a question answering (QA) system which learns how to detect and rank answer passages by analyzing questions and their answers (QA pairs) provided as training data. We b...
141
click to vote
WWW
2002
ACM
16 years 4 months ago
2002
ACM
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
245
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
138
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
158
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...