Sciweavers

NAACL
2007
13 years 6 months ago
A Probabilistic Framework for Answer Selection in Question Answering
This paper describes a probabilistic answer selection framework for question answering. In contrast with previous work using individual resources such as ontologies and the Web to...
Jeongwoo Ko, Luo Si, Eric Nyberg
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 8 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
IPTPS
2004
Springer
13 years 10 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...