Bahman Bahmani
Bahman Bahmani
Verified email at cs.stanford.edu
Title
Cited by
Cited by
Year
Scalable k-means++
B Bahmani, B Moseley, A Vattani, R Kumar, S Vassilvitskii
arXiv preprint arXiv:1203.6402, 2012
6202012
Fast incremental and personalized pagerank
B Bahmani, A Chowdhury, A Goel
arXiv preprint arXiv:1006.2880, 2010
3152010
Densest subgraph in streaming and mapreduce
B Bahmani, R Kumar, S Vassilvitskii
arXiv preprint arXiv:1201.6567, 2012
1932012
Fast personalized pagerank on mapreduce
B Bahmani, K Chakrabarti, D Xin
Proceedings of the 2011 ACM SIGMOD International Conference on Management of …, 2011
1582011
Improved bounds for online stochastic matching
B Bahmani, M Kapralov
European Symposium on Algorithms, 170-181, 2010
862010
Efficient distributed locality sensitive hashing
B Bahmani, A Goel, R Shinde
Proceedings of the 21st ACM international conference on Information and …, 2012
812012
Pagerank on an evolving graph
B Bahmani, R Kumar, M Mahdian, E Upfal
Proceedings of the 18th ACM SIGKDD international conference on Knowledge …, 2012
762012
Partitioned multi-indexing: bringing order to social search
B Bahmani, A Goel
Proceedings of the 21st international conference on World Wide Web, 399-408, 2012
342012
Efficient primal-dual graph algorithms for mapreduce
B Bahmani, A Goel, K Munagala
International Workshop on Algorithms and Models for the Web-Graph, 59-78, 2014
272014
Fast personalized page rank on map reduce
K Chakrabarti, D Xin, B Bahmani
US Patent 8,856,047, 2014
122014
K-means++ vs. Behavioral Biometrics: One Loop to Rule Them All.
P Negi, P Sharma, V Jain, B Bahmani
NDSS, 2018
92018
Online graph edge-coloring in the random-order arrival model
B Bahmani, A Mehta, R Motwani
Theory of Computing 8 (1), 567-595, 2012
62012
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model
B Bahmani, A Mehta, R Motwani
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
62010
A new method for estimating score function difference (sfd) and its application to blind source separation
B Bahmani, M Babaie-Zadeh, C Jutten
2005 13th European Signal Processing Conference, 1-4, 2005
22005
Fast Incremental and Personalized PageRank over Distributed Main Memory Databases
B Bahmani, A Goel, A Chowdhury
12010
ICA by mutual information minimization: An approach for avoiding local minima
M Babaie-Zadeh, B Bahmani, C Jutten
2005 13th European Signal Processing Conference, 1-4, 2005
12005
Systems and methods for generating a dense graph
S Vassilvitskii, S Ravikumar, B Bahmani
US Patent 9,652,875, 2017
2017
PAGERANK ON AN PAGERANK ON AN EVOLVING GRAPH
B Bahmani, R Kumar, M Mahdian, E Upfal, Y Yang
2013
Large Data Algorithmics
B Bahmani
Stanford University, 2012
2012
ICA by mutual information minimization: how to avoid local minima?
M Babaie-Zadeh, B Bahmani, C Jutten
2005
The system can't perform the operation now. Try again later.
Articles 1–20