784 search results - page 8 / 157 » Relaxing the Value Restriction |
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
13 years 2 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
ACMACE
2009
ACM
14 years 2 months ago
2009
ACM
In this study we construct an artificial neural network model of players’ relaxation preferences while playing a physical Wii game. Developed technology will assist game designe...
PVLDB
2008
13 years 7 months ago
2008
Given a dataset containing sensitive personal information, a statistical database answers aggregate queries in a manner that preserves individual privacy. We consider the problem ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Restricted Isometry Constants (RIC) of a matrix A measures how close to an isometry is the action of A on vectors with few nonzero entries, measured in the 2 norm. Specifically...