Sciweavers

2440 search results - page 137 / 488
» Data-Intensive Question Answering
Sort
View
AINA
2007
IEEE
14 years 4 months ago
Towards Quantifying the (In)Security of Networked Systems
Traditional security analyses are often geared towards cryptographic primitives or protocols. Although such analyses are absolutely necessary, they do not provide much insight for...
Xiaohu Li, T. Paul Parker, Shouhuai Xu
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
14 years 2 months ago
Adaptation and the effort needed to adapt
— Tuning a system to an operating environment calls for experimentation, and a question that arises naturally is: how many experiments are needed to come up with a system meeting...
Sergio Bittanti, Marco C. Campi, Maria Prandini
STOC
1998
ACM
105views Algorithms» more  STOC 1998»
14 years 2 months ago
Concurrent Zero-Knowledge
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
Cynthia Dwork, Moni Naor, Amit Sahai
ACL
2003
13 years 11 months ago
Spoken Interactive ODQA System: SPIQA
We have been investigating an interactive approach for Open-domain QA (ODQA) and have constructed a spoken interactive ODQA system, SPIQA. The system derives disambiguating querie...
Chiori Hori, Takaaki Hori, Hajime Tsukada, Hideki ...
AML
2008
72views more  AML 2008»
13 years 10 months ago
On Lachlan's major sub-degree problem
The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees. ...
S. Barry Cooper, Angsheng Li