Kaushik Sinha - Citegraph

Author Info

Name	Affiliation	Papers
KAUSHIK SINHA	Department of Systems and Information Engineering, University of Virginia, Charlottesville, Virginia 22904	29
Collaborators	Citations	PageRank
24	244	17.81
Referers	Referees	References
497	597	336

Search Limit

100597

Publications (29 rows)

Collaborators (24 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Federated Nearest Neighbor Classification with a Colony of Fruit-Flies.	0	0.34	2022
Random projection-based auxiliary information can improve tree-based nearest neighbor search	0	0.34	2021
Fruit-fly Inspired Neighborhood Encoding for Classification	0	0.34	2021
Revisiting kd-tree for Nearest Neighbor Search	2	0.45	2019
IBeaconMap: Automated Indoor Space Representation for Beacon-Based Wayfinding.	0	0.34	2018
Robotic Understanding of Scene Contents and Spatial Constraints.	0	0.34	2018
Improved nearest neighbor search using auxiliary information and priority functions.	2	0.36	2018
K-means clustering using random matrix sparsification.	0	0.34	2018
Improved maximum inner product search with better theoretical guarantee using randomized partition trees.	0	0.34	2018
Exploring Early Stage Cost-Estimation Methods Using Off-The-Shelf Tools: A Preliminary Study	0	0.34	2016
Empirical Validation of Structural Complexity Metric and Complexity Management for Engineering Systems	4	0.48	2016
Complexity Management For Engineered Systems Using System Value Definition	0	0.34	2016
Matrix Energy as a Measure of Topological Complexity of a Graph.	0	0.34	2016
Randomized Partition Trees for Nearest Neighbor Search	22	0.90	2015
Fast £1-norm Nearest Neighbor Search Using A Simple Variant of Randomized Partition Tree.	0	0.34	2015
LSH vs Randomized Partition Trees: Which One to Use for Nearest Neighbor Search?	2	0.39	2014
Randomized partition trees for exact nearest neighbor search	8	0.51	2013
A near-optimal algorithm for differentially-private principal components	23	1.12	2013
Near-optimal Differentially Private Principal Components.	32	1.19	2012
Toward Learning Gaussian Mixtures with Arbitrary Separation	7	0.67	2010
Polynomial Learning of Distribution Families	81	3.51	2010
Semi-supervised Learning using Sparse Eigenfunction Bases.	23	0.89	2009
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow	6	0.84	2007
The Value of Labeled and Unlabeled Examples when the Model is Imperfect	13	0.82	2007
Exploratory Tools for Follow-up Studies to Microarray Experiments	0	0.34	2006
Simultaneous optimization of complex mining tasks with a knowledgeable cache	10	0.49	2005
Using Data Mining Techniques to Learn Layouts of Flat-File Biological Datasets	3	0.40	2005
A framework to support multiple query optimization for complex mining tasks	3	0.36	2005
Learning layouts of biological datasets semi-automatically	3	0.39	2005