Sciweavers

2440 search results - page 153 / 488
» Data-Intensive Question Answering
Sort
View
PROPERTYTESTING
2010
15 years 11 days ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 9 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
119
Voted
DEXA
2005
Springer
93views Database» more  DEXA 2005»
15 years 8 months ago
Provable Data Privacy
In relational database systems a combination of privileges and views is employed to limit a user’s access and to hide non-public data. The data privacy problem is to decide wheth...
Kilian Stoffel, Thomas Studer
IJCAI
2003
15 years 3 months ago
A Revised Algorithm for Latent Semantic Analysis
The intelligent tutoring system AutoTutor uses latent semantic analysis to evaluate student answers to the tutor's questions. By comparing a student's answer to a set of...
Xiangen Hu, Zhiqiang Cai, Max M. Louwerse, Andrew ...
150
Voted
TAL
2010
Springer
15 years 26 days ago
Clustering E-Mails for the Swedish Social Insurance Agency - What Part of the E-Mail Thread Gives the Best Quality?
We need to analyse a large number of e-mails sent by the citizens to the customer services department of a governmental organisation based in Sweden. To carry out this analysis we ...
Hercules Dalianis, Magnus Rosell, Eriks Sneiders