Výsledky vyhledávání - "Coppersmith D"

Report

An approximate Fourier transform useful in quantum factoring

Autor: Coppersmith, D.

We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is currently under i

Externí odkaz: http://arxiv.org/abs/quant-ph/0201067

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Random MAX SAT, random MAX CUT, and their phase transitions

Autor: Coppersmith, D., Gamarnik, D., Hajiaghayi, M., Gregory Sorkin

Publikováno v: Scopus-Elsevier

Given a 2-SAT formula $F$ consisting of $n$ variables and $\cn$ random clauses, what is the largest number of clauses $\max F$ satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of $(3/4)cn$ and $cn$

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64d5f6520191bbf843eac7e9f7b38302
https://doi.org/10.1002/rsa.20015

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Robust Reductions from Ranking to Classification

Autor: Balcan, M.F., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., Sorkin, G.B., Bshouty, N.H., Gentile, C.

Publikováno v: Learning Theory ISBN: 9783540729259
COLT
Learning theory (20th Annual Conference, COLT 2007, San Diego CA, USA, June 13–15, 2007. Proceedings), 604-619
STARTPAGE=604;ENDPAGE=619;TITLE=Learning theory (20th Annual Conference, COLT 2007, San Diego CA, USA, June 13–15, 2007. Proceedings)

We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classification regret of r on the induced binary problem implies an AUC regret of at mo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d8735d51bb5adaa5a65aa0c79c36c81
https://doi.org/10.1007/978-3-540-72927-3_43

Zobrazit plný text záznamu

Minimizing setup and beam-on times in radiation therapy

Autor: Bansal, N., Coppersmith, D., Schieber, B., Diaz, J., Jansen, K., Rolim, J.D.P., Zwick, U.

Publikováno v: Approximation, randomization and combinatorial optimization (9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006, and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006. Proceedings), 27-38
STARTPAGE=27;ENDPAGE=38;TITLE=Approximation, randomization and combinatorial optimization (9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006, and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006. Proceedings)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ISBN: 9783540380443
APPROX-RANDOM

Radiation therapy is one of the commonly used cancer therapies. The radiation treatment poses a tuning problem: it needs to be effective enough to destroy the tumor, but it should maintain the functionality of the organs close to the tumor. Towards t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a354e5741763ffd31c6e3e4dd34124f7
https://research.tue.nl/nl/publications/65d4096c-04ea-4ac7-8efe-afe3fffe5c7f

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání