Find Research outputs

Search results

• Approximating the Ideal Observer for Joint Signal Detection and Localization Tasks by use of Supervised Learning Methods

  Zhou, W., Li, H. & Anastasio, M. A., Dec 2020, In: IEEE transactions on medical imaging. 39, 12, p. 3992-4000 9 p., 9139307.

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Approximating the Ideal Observer and Hotelling Observer for Binary Signal Detection Tasks by Use of Supervised Learning Methods

  Zhou, W., Li, H. & Anastasio, M. A., Oct 2019, In: IEEE transactions on medical imaging. 38, 10, p. 2456-2468 13 p., 8691467.

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Approximating the Hotelling observer with autoencoder-learned efficient channels for binary signal detection tasks

  Granstedt, J. L., Zhou, W. & Anastasio, M. A., Sep 1 2023, In: Journal of Medical Imaging. 10, 5, 055501.

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Approximating the held-karp bound for metric TSP in nearly-linear time

  Chekuri, C. & Quanrud, K., Nov 10 2017, Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society, p. 789-800 12 p. 8104110. (Annual Symposium on Foundations of Computer Science - Proceedings; vol. 2017-October).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating the Fréchet distance for realistic curves in near linear time

  Driemel, A., Har-Peled, S. & Wenk, C., Jul 2012, In: Discrete and Computational Geometry. 48, 1, p. 94-127 34 p.

  Research output: Contribution to journal › Article › peer-review

• Approximating the Fréchet distance for realistic curves in near linear time

  Driemel, A., Har-Peled, S. & Wenk, C., 2010, Proceedings of the 26th Annual Symposium on Computational Geometry, SCG'10. p. 365-374 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

  Chan, T. M., 2000, p. 300-309. 10 p.

  Research output: Contribution to conference › Paper › peer-review

• Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

  Chan, T. M., 2002, In: International Journal of Computational Geometry and Applications. 12, 1-2, p. 67-85 19 p.

  Research output: Contribution to journal › Article › peer-review

• Approximating the complement of the maximum compatible subset of leaves of k trees

  Ganapathy, G. & Warnow, T., 2002, Approximation Algorithms for Combinatorial Optimization - 5th International Workshop, APPROX 2002, Proceedings. Jansen, K., Leonardi, S. & Vazirani, V. (eds.). Springer, p. 122-134 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2462).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating the a;-level in three-dimensional plane arrangements

  Har-Peled, S., Kaplan, H. & Sharir, M., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 1193-1212 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating text-to-pattern Hamming distances

  Chan, T. M., Golan, S., Kociumaka, T., Kopelowitz, T. & Porat, E., Jun 8 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 643-656 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access

• Approximating Submodular k-Partition via Principal Partition Sequence

  Chandrasekaran, K. & Wang, W., Sep 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 3. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 275).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating Steiner k-cuts

  Chekuri, C., Guha, S. & Naor, J., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Baeten, J. C. M., Lenstra, J. K., Parrow, J. & Woeginger, G. J. (eds.). Springer, p. 189-199 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2719).

  Research output: Chapter in Book/Report/Conference proceeding › Chapter

• Approximating shortest paths on a convex polytope in three dimensions

  Har-Peled, S., Sharir, M. & Varadarajan, K. R., 1996, p. 329-338. 10 p.

  Research output: Contribution to conference › Paper › peer-review

  Open Access

• Approximating shortest paths on a convex polytope in three dimensions

  Agarwal, P. K., Har-Peled, S., Sharir, M. & Varadarajan, K. R., Jul 1997, In: Journal of the ACM. 44, 4, p. 567-584 18 p.

  Research output: Contribution to journal › Article › peer-review

• Approximating sensitivity of failure probability in reliability-based design optimization

  Liu, K., Paulino, G. H. & Gardoni, P., 2015, 12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP 2015. University of British Columbia, (12th International Conference on Applications of Statistics and Probability in Civil Engineering, ICASP 2015).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating probabilistic automata by regular languages

  Chadha, R., Sistla, A. P. & Viswanathan, M., Aug 1 2018, Computer Science Logic 2018, CSL 2018. Ghica, D. R. & Jung, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 119).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating Nash social welfare under submodular valuations through (un)matchings

  Garg, J., Kulkarni, P. & Kulkarni, R., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2673-2687 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating Nash social welfare under rado valuations

  Garg, J., Husić, E. & Végh, L. A., Jun 15 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 1412-1425 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating Nash Social Welfare by Matching and Local Search

  Garg, J., Husić, E., Li, W., Végh, L. A. & Vondrák, J., Jun 2 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 1298-1310 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access

• Approximating multicut and the demand graph

  Chekuri, C. & Madan, V., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 855-874 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  Open Access

• Approximating minimization diagrams and generalized proximity search

  Har-Peled, S. & Kumar, N., 2015, In: SIAM Journal on Computing. 44, 4, p. 944-974 31 p.

  Research output: Contribution to journal › Article › peer-review

• Approximating minimization diagrams and generalized proximity search

  Har-Peled, S. & Kumar, N., 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 717-726 10 p. 6686208. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating maximin share allocations

  Garg, J., McGlaughlin, P. & Taki, S., Jan 2019, 2nd Symposium on Simplicity in Algorithms, SOSA 2019 - Co-located with the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA 2019. Fineman, J. T. & Mitzenmacher, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (OpenAccess Series in Informatics; vol. 69).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating k-hop minimum-spanning trees

  Althaus, E., Funke, S., Har-Peled, S., Könemann, J., Ramos, E. A. & Skutella, M., Mar 2005, In: Operations Research Letters. 33, 2, p. 115-120 6 p.

  Research output: Contribution to journal › Article › peer-review

• Approximating high-dimensional infinite-order U-statistics: Statistical and computational guarantees

  Song, Y., Chen, X. & Kato, K., 2019, In: Electronic Journal of Statistics. 13, 2, p. 4794-4848 55 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Approximating flow-based proportional fairness in ad-hoc wireless networks

  Singh, N. & Sreenivas, R. S., 2007, 2007 IEEE Wireless Communications and Networking Conference, WCNC 2007. p. 148-153 6 p. 4204209. (IEEE Wireless Communications and Networking Conference, WCNC).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating extent measures of points

  Agarwal, P. K., Har-Peled, S. & Varadarajan, K. R., Jul 2004, In: Journal of the ACM. 51, 4, p. 606-635 30 p.

  Research output: Contribution to journal › Article › peer-review

• Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets

  Garg, J., Tao, Y. & Vegh, L. A., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 2269-2284 16 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating discrete probability distributions with causal dependence trees

  Quinn, C. J., Coleman, T. P. & Kiyavash, N., 2010, ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications. p. 100-105 6 p. 5649470. (ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating bounded occurrence ordering CSPs

  Guruswami, V. & Zhou, Y., Aug 28 2012, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Proceedings. p. 158-169 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7408 LNCS).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximating a finite metric by a small number of tree metrics

  Charikar, M., Chekuri, C. S., Goel, A., Guha, S. & Plotkin, S., 1998, In: Annual Symposium on Foundations of Computer Science - Proceedings. p. 379-388 10 p.

  Research output: Contribution to journal › Article › peer-review

• Approximate waveforms for extreme-mass-ratio inspirals in modified gravity spacetimes

  Gair, J. & Yunes, N., Sep 14 2011, In: Physical Review D - Particles, Fields, Gravitation and Cosmology. 84, 6, 064016.

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Approximate waveforms for extreme-mass-ratio inspirals: The chimera scheme

  Sopuerta, C. F. & Yunes, N., 2012, In: Journal of Physics: Conference Series. 363, 1, 012021.

  Research output: Contribution to journal › Conference article › peer-review

• Approximate universal relations for neutron stars and quark stars

  Yagi, K. & Yunes, N., Apr 7 2017, In: Physics Reports. 681, p. 1-72 72 p.

  Research output: Contribution to journal › Review article › peer-review

• Approximate universal relations among tidal parameters for neutron star binaries

  Yagi, K. & Yunes, N., Jan 5 2017, In: Classical and Quantum Gravity. 34, 1, 015006.

  Research output: Contribution to journal › Article › peer-review

• Approximate Transformations as Mutation Operators

  Hariri, F., Shi, A., Legunsen, O., Gligoric, M., Khurshid, S. & Misailovic, S., May 25 2018, Proceedings - 2018 IEEE 11th International Conference on Software Testing, Verification and Validation, ICST 2018. Institute of Electrical and Electronics Engineers Inc., p. 285-296 12 p. (Proceedings - 2018 IEEE 11th International Conference on Software Testing, Verification and Validation, ICST 2018).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximate Testing in Uncertain Epidemic Processes

  Bi, X., Miehling, E., Beck, C. & Basar, T., 2022, 2022 IEEE 61st Conference on Decision and Control, CDC 2022. Institute of Electrical and Electronics Engineers Inc., p. 4339-4344 6 p. (Proceedings of the IEEE Conference on Decision and Control; vol. 2022-December).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximate summaries for why and why-not provenance

  Lee, S., Ludäscher, B. & Glavic, B., 2020, In: Proceedings of the VLDB Endowment. 13, 6, p. 912-924 13 p.

  Research output: Contribution to journal › Conference article › peer-review

• Approximate steering of a unicycle under bounded model perturbation using ensemble control

  Becker, A. & Bretl, T., 2012, In: IEEE Transactions on Robotics. 28, 3, p. 580-591 12 p., 6157635.

  Research output: Contribution to journal › Article › peer-review

• Approximate steering of a plate-ball system under bounded model perturbation using ensemble control

  Becker, A. & Bretl, T., 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012. p. 5353-5359 7 p. 6385722. (IEEE International Conference on Intelligent Robots and Systems).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximate spherical blast theory including source mass

  Freiwald, D. A. & Axford, R. A., 1975, In: Journal of Applied Physics. 46, 3, p. 1171-1174 4 p.

  Research output: Contribution to journal › Article › peer-review

• Approximate sparse linear regression

  Har-Peled, S., Indyk, P. & Mahabadi, S., Jul 1 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 77. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximate solutions for oblique detonations in the hypersonic limit

  Powers, J. M. & Stewart, D. S., Mar 1992, In: AIAA journal. 30, 3, p. 726-736 11 p.

  Research output: Contribution to journal › Article › peer-review

• Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions

  Har-Peled, S., 1997, p. 359-365. 7 p.

  Research output: Contribution to conference › Paper › peer-review

• Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions

  Har-Peled, S., Mar 1999, In: Discrete and Computational Geometry. 21, 2, p. 217-231 15 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Approximate shortest paths and distance oracles in weighted unit-disk graphs

  Chan, T. M. & Skrepetos, D., 2019, In: Journal of Computational Geometry. 10, 2, p. 3-20 18 p.

  Research output: Contribution to journal › Article › peer-review

• Approximate shortest paths and distance oracles in weighted unit-disk graphs

  Chan, T. M. & Skrepetos, D., Jun 1 2018, 34th International Symposium on Computational Geometry, SoCG 2018. Toth, C. D. & Speckmann, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 241-2413 2173 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 99).

  Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

• Approximate shape fitting via linearization

  Har-Peled, S. & Varadarajan, K. R., 2001, In: Annual Symposium on Foundations of Computer Science - Proceedings. p. 66-73 8 p.

  Research output: Contribution to journal › Article › peer-review

• Approximate set-valued observers for nonlinear systems

  Shamma, J. S. & Tu, K. Y., 1997, In: IEEE Transactions on Automatic Control. 42, 5, p. 648-658 11 p.

  Research output: Contribution to journal › Article › peer-review