Bahman Bahmani

According to our database, Bahman Bahmani authored at least 15 papers between 2005 and 2018.

Collaborative distances:

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

2018

K-means++ vs. Behavioral Biometrics: One Loop to Rule Them All.

Parimarjan Negi, Prafull Sharma, Vivek Jain, Bahman Bahmani

Proceedings of the 25th Annual Network and Distributed System Security Symposium, 2018

2014

Efficient Primal-Dual Graph Algorithms for MapReduce.

Bahman Bahmani, Ashish Goel, Kamesh Munagala

Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2012

Online Graph Edge-Coloring in the Random-Order Arrival Model.

Bahman Bahmani, Aranyak Mehta, Rajeev Motwani

Theory Comput., 2012

Scalable K-Means++.

Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii

Proc. VLDB Endow., 2012

Densest Subgraph in Streaming and MapReduce.

Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii

Proc. VLDB Endow., 2012

Partitioned multi-indexing: bringing order to social search.

Bahman Bahmani, Ashish Goel

Proceedings of the 21st World Wide Web Conference 2012, 2012

PageRank on an evolving graph.

Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Efficient distributed locality sensitive hashing.

Bahman Bahmani, Ashish Goel, Rajendra Shinde

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

Fast personalized PageRank on MapReduce.

Bahman Bahmani, Kaushik Chakrabarti, Dong Xin

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

2010

Fast Incremental and Personalized PageRank.

Bahman Bahmani, Abdur Chowdhury, Ashish Goel

Proc. VLDB Endow., 2010

Fast Incremental and Personalized PageRank over Distributed Main Memory Databases

Bahman Bahmani, Abdur Chowdhury, Ashish Goel

CoRR, 2010

A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model.

Bahman Bahmani, Aranyak Mehta, Rajeev Motwani

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Improved Bounds for Online Stochastic Matching.

Bahman Bahmani, Michael Kapralov

Proceedings of the Algorithms, 2010

2005

A new method for estimating score function difference (SFD) and its application to Blind Source Separation.

Bahman Bahmani, Massoud Babaie-Zadeh, Christian Jutten

Proceedings of the 13th European Signal Processing Conference, 2005

ICA by mutual information minimization: An approach for avoiding local minima.

Massoud Babaie-Zadeh, Bahman Bahmani, Christian Jutten

Proceedings of the 13th European Signal Processing Conference, 2005