V
Vinayaka Pandit
Researcher at IBM
Publications - 76
Citations - 2667
Vinayaka Pandit is an academic researcher from IBM. The author has contributed to research in topics: Approximation algorithm & Resource allocation. The author has an hindex of 20, co-authored 76 publications receiving 2491 citations. Previous affiliations of Vinayaka Pandit include Indian Institutes of Technology.
Papers
More filters
Journal ArticleDOI
Local Search Heuristics for k -Median and Facility Location Problems
TL;DR: This work analyzes local search heuristics for the metric k-median and facility location problems and shows that local search with swaps has a locality gap of 5 and introduces a new local search operation which opens one or more copies of a facility and drops zero or more facilities.
Proceedings ArticleDOI
An Overview of the BlueGene/L Supercomputer
N. R. Adiga,Gheorghe Almasi,George Almási,Y. Aridor,Rajkishore Barik,D. Beece,Ralph Bellofatto,Gyan Bhanot,R. Bickford,Matthias A. Blumrich,A. A. Bright,Jose R. Brunheroto,Calin Cascaval,José G. Castaños,Waiman Chan,Luis Ceze,Paul W. Coteus,Siddhartha Chatterjee,Dong Chen,G. Chiu,Thomas Mario Cipolla,Paul G. Crumley,K.M. Desai,A. Deutsch,T. Domany,M. B. Dombrowa,Wilm E. Donath,Maria Eleftheriou,C. Christopher Erway,J. Esch,Blake G. Fitch,J. Gagliano,Alan Gara,Rahul Garg,Robert S. Germain,Mark E. Giampapa,B. Gopalsamy,John A. Gunnels,Manish Gupta,Fred G. Gustavson,Shawn A. Hall,R. A. Haring,D. Heidel,P. Heidelberger,L.M. Herger,Dirk Hoenicke,Rory D. Jackson,T. Jamal-Eddine,Gerard V. Kopcsay,Elie Krevat,Manish P. Kurhekar,A.P. Lanzetta,Derek Lieber,L.K. Liu,M. Lu,M. Mendell,A. Misra,Yosef Moatti,L. Mok,José E. Moreira,Ben J. Nathanson,M. Newton,Martin Ohmacht,Adam J. Oliner,Vinayaka Pandit,R.B. Pudota,Rick A. Rand,R. Regan,B. Rubin,Albert E. Ruehli,Silvius Rus,Ramendra K. Sahoo,A. Sanomiya,Eugen Schenfeld,M. Sharma,E. Shmueli,Suryabhan Singh,Peilin Song,Vijayalakshmi Srinivasan,Burkhard Steinmacher-Burow,Karin Strauss,C. Surovic,Richard A. Swetz,Todd E. Takken,R.B. Tremaine,M. Tsao,A. R. Umamaheshwaran,P. Verma,Pavlos M. Vranas,T.J.C. Ward,M. Wazlowski,William A. Barrett,C. Engel,B. Drehmel,B. Hilgart,D. Hill,F. Kasemkhani,D. Krolak,C.T. Li,T. Liebsch,James Anthony Marcella,Adam J. Muff,A. Okomo,M. Rouse,A. Schram,Matthew R. Tubbs,G. Ulsh,Charles D. Wait,J. Wittrup,M. Bae,Kenneth Alan Dockser,Lynn Kissel,M.K. Seager,Jeffrey S. Vetter,K. Yates +114 more
TL;DR: An overview of the BlueGene/L Supercomputer, a massively parallel system of 65,536 nodes based on a new architecture that exploits system-on-a-chip technology to deliver target peak processing power of 360 teraFLOPS (trillion floating-point operations per second).
Proceedings ArticleDOI
Local search heuristic for k-median and facility location problems
TL;DR: This paper analyzes local search heuristics for the k-median and facility location problems and proves that without this stretch, the problem becomes NP-Hard to approximate.
Proceedings ArticleDOI
Robust fingerprint authentication using local structural similarity
TL;DR: This work proposes a novel, efficient, accurate and distortion-tolerant fingerprint authentication technique based on graph representation that has been tested with excellent results on a large private livescan database obtained with optical scanners.
Proceedings ArticleDOI
Decision trees for entity identification: approximation algorithms and hardness results
TL;DR: A natural greedy algorithm is considered and an approximation guarantee of O(rK • log N) is proved, where N is the number of entities and K is the maximum number of distinct values of an attribute, which shows that it is NP-hard to approximate the problem within a factor of Ω(log N).