Sciweavers

2835 search results - page 183 / 567
» Automatic Question Answering
Sort
View
102
Voted
ORL
2007
86views more  ORL 2007»
15 years 4 months ago
Complexity of two dual criteria scheduling problems
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
PROPERTYTESTING
2010
15 years 2 months 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 11 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
135
Voted
DEXA
2005
Springer
93views Database» more  DEXA 2005»
15 years 10 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 6 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 ...