Sciweavers

8699 search results - page 1527 / 1740
» Elements of the Theory of Computation
Sort
View
CP
2011
Springer
14 years 6 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
CSFW
2011
IEEE
14 years 6 months ago
Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection
Abstract—Audit mechanisms are essential for privacy protection in permissive access control regimes, such as in hospitals where denying legitimate access requests can adversely a...
Jeremiah Blocki, Nicolas Christin, Anupam Datta, A...
ICC
2011
IEEE
203views Communications» more  ICC 2011»
14 years 6 months ago
Constellation Shaping for Bit-Interleaved Coded APSK
—This paper considers a technique for shaping a turbo-coded amplitude-phase shift keying (APSK) constellation. After bit-interleaving, a subset of the bits output by a binary tur...
Matthew C. Valenti, Xingyu Xiang

Publication
233views
14 years 5 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
CSCW
2012
ACM
14 years 2 months ago
Setting the stage for interaction: a tablet application to augment group discussion in a seminar class
We present a tablet-based system to collaboratively track discussion topics and ideas in a seminar-style discussion classroom. Each student uses his or her own tablet to share tex...
Drew Harry, Eric Gordon, Chris Schmandt
« Prev « First page 1527 / 1740 Last » Next »