Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Kedar Dhamdhere"'
Autor:
Harald Räcke, Anupam Gupta, Kedar Dhamdhere, Anastasios Sidiropoulos, Mihai Badoiu, Yuri Rabinovich, Piotr Indyk, R. Ravi
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:454-473
We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the 2-dimensional plane. Among other results, we give an $O(\sqrt{n})$-approximation alg...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::144b47bda33987655af3864c6f197b20
https://doi.org/10.1137/17m1113527
https://doi.org/10.1137/17m1113527
Publikováno v:
ACL (1)
We analyze state-of-the-art deep learning models for three tasks: question answering on (1) images, (2) tables, and (3) passages of text. Using the notion of \emph{attribution} (word importance), we find that these deep networks often ignore importan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8c0b834c166b59ba90307cad2662866
http://arxiv.org/abs/1805.05492
http://arxiv.org/abs/1805.05492
Autor:
Srinath Sridhar, Kedar Dhamdhere, Blelloch, Guy, Halperin, Eran, Ramamoorthi Ravi, Schwartz, Russell
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98107fcc8fc61ce03303364210db1a8a
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worst-case among the various uncertain scenarios in the model. While these approaches m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e0b28bb657cac7ead16e1272fd1e8b9
Publikováno v:
IUI
We describe Analyza, a system that helps lay users explore data. Analyza has been used within two large real world systems. The first is a question-and-answer feature in a spreadsheet product. The second provides convenient access to a revenue/invent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1de42db9685b0d4dcddd3ccf587cbf1
https://doi.org/10.1145/3025171.3025227
https://doi.org/10.1145/3025171.3025227
Publikováno v:
SIAM Journal on Computing. 38:2303-2329
We consider the problem of embedding finite metrics with slack: We seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of all distances to be arbitrarily distorted. This definition is motivated by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f64b72c1849ce9486b47693bdac81f8b
https://doi.org/10.1137/060670511
https://doi.org/10.1137/060670511
Publikováno v:
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 4:561-571
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e10cb6b2a838c3382672464a54a49d0
https://doi.org/10.1109/tcbb.2007.1070
https://doi.org/10.1109/tcbb.2007.1070
Publikováno v:
Algorithmica. 40:305-318
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. Our focus is on minimizing the mean slowdown, where the slowdown (also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7d94e0fd16a21f93f2c80032bbfa556
https://doi.org/10.1007/s00453-004-1115-0
https://doi.org/10.1007/s00453-004-1115-0
Autor:
Kedar Dhamdhere, Nikhil Bansal
Publikováno v:
ACM Transactions on Algorithms, 3(4):39, 39-1/14. Association for Computing Machinery, Inc
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003, Baltimore MD, USA, January 12-14, 2003), 508-516
STARTPAGE=508;ENDPAGE=516;TITLE=Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003, Baltimore MD, USA, January 12-14, 2003)
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003, Baltimore MD, USA, January 12-14, 2003), 508-516
STARTPAGE=508;ENDPAGE=516;TITLE=Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003, Baltimore MD, USA, January 12-14, 2003)
We consider the problem of minimizing the total weighted flow time on a single machine with preemptions. We give an online algorithm that is O ( k )-competitive for k weight classes. This implies an O (log W )-competitive algorithm, where W is the ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17a537d303a4c431f34198c2cc3a51d3
https://research.tue.nl/nl/publications/ef0c7a43-f8a9-4b41-b239-dfb3aa7cf8a2
https://research.tue.nl/nl/publications/ef0c7a43-f8a9-4b41-b239-dfb3aa7cf8a2
Publikováno v:
Pacific Symposium on Biocomputing
Scopus-Elsevier
Scopus-Elsevier
The arrival of publicly available genome-wide variation data is creating new opportunities for reconciling model-based methods for associating genotypes and phenotypes with the complexities of real genome data. Such data is particularly valuable for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::590a6b4cf8855778933bcab520ff79da
https://pubmed.ncbi.nlm.nih.gov/17094260
https://pubmed.ncbi.nlm.nih.gov/17094260