Sciweavers

1055 search results - page 173 / 211
» Enumerations in computable structure theory
Sort
View
WWW
2005
ACM
14 years 8 months ago
XQuery containment in presence of variable binding dependencies
Semantic caching is an important technology for improving the response time of future user queries specified over remote servers. This paper deals with the fundamental query conta...
Li Chen, Elke A. Rundensteiner
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 8 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
POPL
2005
ACM
14 years 8 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic
AIED
2009
Springer
14 years 2 months ago
Discovering Tutorial Dialogue Strategies with Hidden Markov Models
Identifying effective tutorial strategies is a key problem for tutorial dialogue systems research. Ongoing work in human-human tutorial dialogue continues to reveal the complex phe...
Kristy Elizabeth Boyer, Eunyoung Ha, Michael D. Wa...