876 search results - page 29 / 176 » New Results for the Martin Polynomial |
EOR
2008
13 years 8 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
JOC
2000
13 years 8 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
RECOMB
2007
Springer
14 years 9 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
COLT
1999
Springer
14 years 28 days ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...