Publications
Found 223 results
[ Author] Title Type Year Filters: First Letter Of Last Name is H [Clear All Filters]
(1989).
(1989).
(1988).
(1989).
(2013).
(2009).
Statistical Sentence Extraction for Information Distillation.
Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2007). 4, 1-4.
(2007).
(2009). Exploiting Information Extraction Annotations for Document Retrieval in Distillation Tasks.
Proceedings of the 8th Annual Conference of the International Speech Communication Association (Interspeech 2007). 330-333.
(2007).
(2004).
(2010). Polylogarithmic Inapproximability.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
(2003).
(2002). Haplofreq - Estimating Haplotype Frequencies Efficiently.
Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05). 553-568.
(2005). The Minimum-Entropy Set Cover Problem.
Proceedings of ICALP.
(2004). Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.
Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA).
(2003). Tag SNP Selection in Genotype Data for Maximizing SNP Prediction Accuracy.
Proceedings of the 13th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2005). 195-203.
(2005).
(2002). SNP Imputation in Association Studies.
Nature Biotechnology. 27(4), 349-351.
(2009). Perfect Phylogeny and Haplotype Assignment.
Proceedings of RECOMB.
(2004). Detecting Protein Sequences via Metric Embeddings.
Proceedings of the 11th International Conference on Intelligent Systems for Molecular Biology (ISMB). 122-129.
(2003). Estimating Haplotype Frequencies Efficiently.
Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05). 553-568.
(2005). Maximizing Power in Association Studies.
Nature Biotechnology. 27(3), 255-256.
(2009). The Minimum-Entropy Set Cover Problem.
Theoretical Computer Science. 348(2), 240-250.
(2005).
(2012).