BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
4 × USA
Collaborated with:
A.G.Gray W.B.March N.Koenigstein Y.Shavitt R.R.Curtin D.V.Anderson C.L.Isbell
Talks about:
tree (5) algorithm (2) recommend (1) framework (1) euclidean (1) independ (1) retriev (1) product (1) minimum (1) maximum (1)

Person: Parikshit Ram

DBLP DBLP: Ram:Parikshit

Contributed to:

ICML c3 20132013
CIKM 20122012
KDD 20122012
KDD 20112011
KDD 20102010

Wrote 5 papers:

ICML-c3-2013-CurtinMRAGI #algorithm #independence
Tree-Independent Dual-Tree Algorithms (RRC, WBM, PR, DVA, AGG, CLI), pp. 1435–1443.
CIKM-2012-KoenigsteinRS #framework #matrix #performance #recommendation #retrieval
Efficient retrieval of recommendations in a matrix factorization framework (NK, PR, YS), pp. 535–544.
KDD-2012-RamG #using
Maximum inner-product search using cone trees (PR, AGG), pp. 931–939.
KDD-2011-RamG #estimation
Density estimation trees (PR, AGG), pp. 627–635.
KDD-2010-MarchRG #algorithm #analysis #performance
Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.