Pegah Kamousi

According to our database, Pegah Kamousi authored at least 8 papers between 2011 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

A Few-Shot Sequential Approach for Object Counting.

Negin Sokhandan, Pegah Kamousi, Alejandro Posada, Eniola Alese, Negar Rostamzadeh

CoRR, 2020

2016

Analysis of farthest point sampling for approximating geodesics in a graph.

Pegah Kamousi, Sylvain Lazard, Anil Maheshwari, Stefanie Wuhrer

Comput. Geom., 2016

2014

Closest pair and the post office problem for stochastic points.

Pegah Kamousi, Timothy M. Chan, Subhash Suri

Comput. Geom., 2014

2013

Memory Efficient Minimum Substring Partitioning.

Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri

Proc. VLDB Endow., 2013

Euclidean Traveling Salesman Tours through Stochastic Neighborhoods.

Pegah Kamousi, Subhash Suri

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Memory Efficient De Bruijn Graph Construction

Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri

CoRR, 2012

2011

Stochastic minimum spanning trees in euclidean spaces.

Pegah Kamousi, Timothy M. Chan, Subhash Suri

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Stochastic Minimum Spanning Trees and Related Problems.

Pegah Kamousi, Subhash Suri

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011