291 search results - page 37 / 59 » Approximate centerpoints with proofs |
104
Voted
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
ISSAC
2009
Springer
15 years 8 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
117
Voted
IAT
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper extends the link between evolutionary game theory and multi-agent reinforcement learning to multistate games. In previous work, we introduced piecewise replicator dynam...
96
Voted
ACISP
2004
Springer
15 years 7 months ago
2004
Springer
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
GLVLSI
2002
IEEE
15 years 6 months ago
2002
IEEE
— The high-order compact finite difference (HCFD) method is adapted for interconnect modeling. Based on the compact finite difference method, the HCFD method employs the Chebys...