Sciweavers

725 search results - page 49 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
JCO
1998
69views more  JCO 1998»
14 years 9 months ago
Sortabilities of Partition Properties
Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to...
Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Fr...
CORR
2010
Springer
76views Education» more  CORR 2010»
14 years 9 months ago
Query Strategies for Evading Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 1 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
Correlated Equilibria in Continuous Games: Characterization and Computation
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
FCT
2005
Springer
15 years 3 months ago
Almost Optimal Explicit Selectors
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Bogdan S. Chlebus, Dariusz R. Kowalski