3006 search results - page 352 / 602 » Dimensionality reduction and generalization |
211
click to vote
SIAMCOMP
2011
15 years 1 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
158
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
171
click to vote
NCA
2005
IEEE
16 years 7 days ago
2005
IEEE
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...
207
click to vote
CSCLP
2004
Springer
16 years 1 days ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
148
click to vote
CRYPTO
2003
Springer
15 years 12 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...