Find Research outputs

Search results

• Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover

  Deshpande, A., Hellerstein, L. & Kletenik, D., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 1453-1467 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

• Approximation algorithms for QMA-complete problems

  Gharibian, S. & Kempe, J., 2011, Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011. p. 178-188 11 p. 5959807. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

• Approximation algorithms for QMA-complete problems

  Gharibian, S. & Kempe, J., 2012, In: SIAM Journal on Computing. 41, 4, p. 1028-1050 23 p.

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

• Approximation Algorithms for Model-Based Compressive Sensing

  Hegde, C., Indyk, P. & Schmidt, L., Sep 1 2015, In: IEEE Transactions on Information Theory. 61, 9, p. 5129-5147 19 p., 7161330.

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

• Approximation Algorithms for Minimum-Width Annuli and Shells

  Agarwal, P. K., Aronov, B., Har-Peled, S. & Sharir, M., Dec 2000, In: Discrete and Computational Geometry. 24, 4, p. 687-705 19 p.

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

  Open Access

• Approximation algorithms for MAX-MIN tiling

  Berman, P., DasGupta, B. & Muthukrishnan, S., Jul 2003, In: Journal of Algorithms. 47, 2, p. 122-134 13 p.

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

• Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons

  Abam, M. A., Aronov, B., De Berg, M. & Khosravi, A., 2011, Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11. p. 407-416 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

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

• Approximation algorithms for average stretch scheduling

  Bender, M. A., Muthukrishnan, S. & Rajaraman, R., May 2004, In: Journal of Scheduling. 7, 3, p. 195-222 28 p.

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

• Approximation algorithms for array partitioning problems

  Muthukrishnan, S. & Suel, T., Jan 2005, In: Journal of Algorithms. 54, 1, p. 85-104 20 p.

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

• Approximating the real structured stability radius with frobenius-norm bounded perturbations

  Guglielmi, N., Gürbüzbalaban, M., Mitchell, T. & Overton, M. L., 2017, In: SIAM Journal on Matrix Analysis and Applications. 38, 4, p. 1323-1353 31 p.

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

• Approximating the Nash social welfare with indivisible items

  Cole, R. & Gkatzelis, V., Jun 14 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 371-380 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

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

• Approximating the nash social welfare with indivisible items

  Cole, R. & Gkatzelis, V., 2018, In: SIAM Journal on Computing. 47, 3, p. 1211-1236 26 p.

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

• Approximating the mean waiting time under a TDMA schedule

  Philips, T. K. & Panwar, S., 1990, Proceedings of the Allerton Conference on Communications, Control, and Computing, Oct. 3-5, 1990.

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

• Approximating the little Grothendieck problem over the orthogonal and unitary groups

  Bandeira, A. S., Kennedy, C. & Singer, A., Nov 1 2016, In: Mathematical Programming. 160, 1-2, p. 433-475 43 p.

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

• Approximating the Gaussian as a Sum of Exponentials and its Applications to the Fast Gauss Transform

  Jiang, S. & Greengard, L., 2021, In: Communications in Computational Physics. 31, 1, p. 1-26 26 p.

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

  Open Access

• Approximating the distribution of maximally selected McNemar's statistics

  Rabinowitz, D. & Betensky, R. A., 2000, In: Biometrics. 56, 3, p. 897-902 6 p.

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

• Approximating the cut-norm via Grothendieck's inequality

  Alon, N. & Naor, A., 2004, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 72-80 9 p.

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

• Approximating the cut-norm via grothendieck's inequality

  Alon, N. & Naor, A., 2006, In: SIAM Journal on Computing. 35, 4, p. 787-803 17 p.

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

• Approximating the age of RF/analog circuits through re-characterization and statistical estimation

  Chang, D., Ozev, S., Sinanoglu, O. & Karri, R., 2014, Proceedings - Design, Automation and Test in Europe, DATE 2014. Institute of Electrical and Electronics Engineers Inc., 6800249. (Proceedings -Design, Automation and Test in Europe, DATE).

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

• Approximating subdifferentials by random sampling of gradients

  Burke, J. V., Lewis, A. S. & Overton, M. L., Aug 2002, In: Mathematics of Operations Research. 27, 3, p. 567-584 18 p.

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

• Approximating queue size dynamics at actuated signalized intersections using event-based traffic data

  Jabari, S. E. G., 2010, INFORMS 2010 Annual Meeting. Austin, TX. 2010.

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

• Approximating queue size dynamics at actuated signalized intersections

  Jabari, S. E. G., 2011, 90th TRB Annual Meeting. Washington, D.C. 2011.

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

• Approximating orthogonal matrices with effective givens factorization

  Frerix, T. & Bruna, J., Jan 1 2019, 36th International Conference on Machine Learning, ICML 2019. International Machine Learning Society (IMLS), p. 3509-3517 9 p. (36th International Conference on Machine Learning, ICML 2019; vol. 2019-June).

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

• Approximating minimum-weight triangulations in three dimensions

  Aronov, B. & Fortune, S., Jun 1999, In: Discrete and Computational Geometry. 21, 4, p. 527-549 23 p.

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

  Open Access

• Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions

  Daescu, O., Mitchell, J. S. B., Ntafos, S., Palmer, J. D. & Yap, C. K., 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Association for Computing Machinery (ACM), p. 483-484 2 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

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

• APPROXIMATING MATRIX EIGENVALUES BY SUBSPACE ITERATION WITH REPEATED RANDOM SPARSIFICATION

  Greene, S. M., Webber, R. J., Berkelbach, T. C. & Weare, J., 2022, In: SIAM Journal on Scientific Computing. 44, 5

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

• Approximating Matrices and Convex Bodies

  Friedland, O. & Youssef, P., Apr 24 2019, In: International Mathematics Research Notices. 2019, 8, p. 2519-2537 19 p.

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

  Open Access

• Approximating gradients for differentiable quality diversity in reinforcement learning

  Tjanaka, B., Fontaine, M. C., Togelius, J. & Nikolaidis, S., Jul 8 2022, GECCO 2022 - Proceedings of the 2022 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc, p. 1102-1111 10 p. (GECCO 2022 - Proceedings of the 2022 Genetic and Evolutionary Computation Conference).

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

  Open Access

• Approximating Data with the Count-Min Sketch

  Cormode, G. & Muthukrishnan, S., 2012, In: IEEE Software. 29, 1, p. 64-69 6 p.

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

• Approximating CSPs using LP relaxation

  Khot, S. & Saket, R., 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Verlag, p. 822-833 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

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

• Approximating a bandlimited function using very coarsely quantized data: Improved error estimates in sigma-delta modulation

  Güntürk, C. S., Jan 2004, In: Journal of the American Mathematical Society. 17, 1, p. 229-242 14 p.

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

• Approximate volume rendering for curvilinear and unstructured grids by hardware-assisted polyhedron projection

  Max, N., Williams, P. & Silva, C., 2000, In: International Journal of Imaging Systems and Technology. 11, 1, p. 53-61 9 p.

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

• Approximate tree pattern matching

  Shasha, D. & Zhang, K., 1997, Pattern matching strings, trees, and arrays. Apostolico, A. & Galil, Z. (eds.). Oxford University Press, p. 341-371

  Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed) › peer-review

• Approximate tree matching in the presence of variable length don′t cares

  Zhang, K., Shasha, D. & Wang, J. T. L., Jan 1994, In: Journal of Algorithms. 16, 1, p. 33-66 34 p.

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

• Approximate tree matching and shape similarity

  Liu, T. L. & Geiger, D., 1999, In: Proceedings of the IEEE International Conference on Computer Vision. 1, p. 456-462 7 p.

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

• Approximate string matching: A simpler faster algorithm

  Cole, R. & Hariharan, R., Sep 2002, In: SIAM Journal on Computing. 31, 6, p. 1761-1782 22 p.

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

• Approximate string matching: A simpler faster algorithm

  Cole, R. & Hariharan, R., 1998, p. 463-472. 10 p.

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

• Approximate string joins in a database (almost) for free

  Gravano, L., Ipeirotis, P. G., Jagadish, H. V., Koudas, N., Muthukrishnan, S. & Srivastava, D., 2001, VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases. Apers, P. M. G., Atzeni, P., Snodgrass, R. T., Ceri, S., Ramamohanarao, K. & Paraboschi, S. (eds.). Morgan Kaufmann, p. 491-500 10 p. (VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases).

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

• Approximate solution of a finite many-particle system with translational invariance. I

  Vassell, M. O., Borowitz, S. & Percus, J. K., 1964, In: Physical Review. 136, 5B, p. B1266-B1278

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

• Approximate representation of functions of several variables in terms of functions of one variable

  Frisch, H. L., Borzi, C., Ord, G., Percus, J. K. & Williams, G. O., 1989, In: Physical Review Letters. 63, 9, p. 927-929 3 p.

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

• Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time

  Cole, R. & Vishkin, U., 1988, In: SIAM Journal on Computing. 17, 1, p. 128-142 15 p.

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

• Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms

  Cole, R. & Vishkin, U., May 1991, In: Information and Computation. 92, 1, p. 1-47 47 p.

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

• Approximate on-the-fly coarse-grained reconfigurable acceleration for general-purpose applications

  Brandalero, M., Beck, A. C. S., Carro, L. & Shafique, M., Jun 24 2018, Proceedings of the 55th Annual Design Automation Conference, DAC 2018. Institute of Electrical and Electronics Engineers Inc., a160. (Proceedings - Design Automation Conference; vol. Part F137710).

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

• Approximate networking for universal internet access

  Qadir, J., Sathiaseelan, A., Farooq, U. B., Usama, M., Imran, M. A. & Shafique, M., Dec 11 2017, In: Future Internet. 9, 4, 94.

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

  Open Access

• Approximate nearest neighbors and sequence comparison with block operations

  Muthukrishnan, S. & Sahinalp, S. C., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 416-424 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

• Approximate message passing with consistent parameter estimation and applications to sparse learning

  Kamilov, U. S., Rangan, S., Fletcher, A. K. & Unser, M., May 2014, In: IEEE Transactions on Information Theory. 60, 5, p. 2969-2985 17 p., 6775335.

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

• Approximate message passing with consistent parameter estimation and applications to sparse learning

  Kamilov, U. S., Rangan, S., Fletcher, A. K. & Unser, M., 2012, Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012, NIPS 2012. p. 2438-2446 9 p. (Advances in Neural Information Processing Systems; vol. 3).

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

• Approximate maximum weight branchings

  Bagchi, A., Bhargava, A. & Suel, T., Jul 31 2006, In: Information Processing Letters. 99, 2, p. 54-58 5 p.

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

• Approximate macroscopic equations

  Arsénio, D. & Saint-Raymond, L., 2019, FROM THE VLASOV-MAXWELL-BOLTZMANN SYSTEM TO INCOMPRESSIBLE VISCOUS ELECTRO-MAGNETO-HYDRODYNAMICS, VOL 1. p. 263-311 (EMS Monographs in Mathematics).

  Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed) › peer-review

• Approximately certifying the restricted isometry property is hard

  Weed, J., Aug 2018, In: IEEE Transactions on Information Theory. 64, 8, p. 5488-5497 10 p.

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

  Open Access