نتائج البحث

A refined approximation for Euclidean k-means

• Authors : Grandoni, Fabrizio; Ostrovsky, Rafail; Rabani, Yuval

Subjects: Approximation algorithms; Euclidean k-means; Euclidean facility location

• Source: Information Processing Letters, 176, Art. No. 106251, (2022-06)

تفاصيل العنوان

Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems

• Authors : Harrow, Aram W.; Mehraban, Saeed; Soleimanifar, Mehdi

Subjects: quantum many-body systems; partition function; decay of correlations

• Source: 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020), Chicago, IL, 22-26 June 2020

تفاصيل العنوان

A Parallelizable Acceleration Framework for Packing Linear Programs

• Authors : London, Palma; Vardi, Shai; Wierman, Adam

Subjects: Approximation algorithms; Acceleration; Parallel algorithms

• Source: 2018 Information Theory and Applications Workshop (ITA), San Diego, CA, 11-16 February 2018

تفاصيل العنوان

Near-optimal Bayesian active learning with correlated and noisy tests

• Authors : Chen, Yuxin; Hassani, S. Hamed; Krause, Andreas

Subjects: Bayesian active learning; information gathering; decision making

• Source: Electronic Journal of Statistics, 11(2), 4969-5017, (2017-12-15)

تفاصيل العنوان

Efficient Rounding for the Noncommutative Grothendieck Inequality

• Authors : Naor, Assaf; Regev, Oded; Vidick, Thomas

Subjects: approximation algorithms; Grothendieck inequality; semidefinite programming

• Source: Theory of Computing, 10(1), 257-295, (2014-10-02)

تفاصيل العنوان

Graphs with tiny vector chromatic numbers and huge chromatic numbers

• Authors : Feige, Uriel; Langberg, Michael; Schechtman, Gideon

Subjects: semidefinite programming; chromatic number; independent set

• Source: SIAM Journal on Computing, 33(6), 1338-1368, (2004)

تفاصيل العنوان

Truthful approximation mechanisms for restricted combinatorial auctions

• Authors : Mu'alem, Ahuva; Nisan, Noam

Subjects: Mechanism design; Combinatorial auctions; Multi-unit auctions

• Source: Games and Economic Behavior, 64(2), 612-631, (2008-11)

تفاصيل العنوان

Algorithms for Computing QoS Paths With Restoration

• Authors : Bejerano, Yigal; Breitbart, Yuri; Orda, Ariel

Subjects: Approximation algorithms; QoS routing; restoration

• Source: IEEE/ACM Transactions on Networking, 13(3), 648-661, (2005-06)

تفاصيل العنوان

Differentially private combinatorial optimization

• Authors : Gupta, Anupam; Ligett, Katrina; McSherry, Frank

• Source: Twenty-first annual ACM-SIAM symposium on Discrete algorithms (SODA '10), Austin, TX, 17-19 January 2010

تفاصيل العنوان

Efficient Rounding for the Noncommutative Grothendieck Inequality

• Authors : Naor, Assaf; Regev, Oded; Vidick, Thomas

Subjects: Grothendieck inequality; rounding algorithm; semidefinite programming

• Source: Forty-fifth annual ACM symposium on Theory of Computing (ToC), Palo Alto, CA, June 1-4, 2013

تفاصيل العنوان