default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVinay Deolalikar
Person information
- affiliation: Hewlett Packard Development Company
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c27]Neeraj Pradhan, Vinay Deolalikar, Deependra Singh:
Islands of Interest: Mining Concentrations of User Search Intent over e-Commerce Product Categories. IEEE BigData 2018: 3717-3722- [c26]Deependra Singh, Vinay Deolalikar:
Automating Relevance Banding in e-Commerce Search using Click Model. IEEE BigData 2018: 3793-3797 - 2016
- [c25]Vinay Deolalikar, Hernan Laffitte:
Extensive large-scale study of error surfaces in sampling-based distinct value estimators for databases. IEEE BigData 2016: 1579-1586 - [i1]Vinay Deolalikar, Hernan Laffitte:
Extensive Large-Scale Study of Error in Samping-Based Distinct Value Estimators for Databases. CoRR abs/1612.00476 (2016) - 2015
- [c24]Vinay Deolalikar:
How valuable is your data? A quantitative approach using data mining. IEEE BigData 2015: 1248-1253 - [c23]Kang Li, Vinay Deolalikar, Neeraj Pradhan:
Mining lifestyle personas at scale in e-commerce. IEEE BigData 2015: 1254-1261 - [c22]Kang Li, Vinay Deolalikar, Neeraj Pradhan:
Big data gathering and mining pipelines for CRM using open-source. IEEE BigData 2015: 2936-2938 - [c21]Neeraj Pradhan, Vinay Deolalikar, Kang Li:
Atypical Queries in eCommerce. CIKM 2015: 1767-1770 - [c20]Vinay Deolalikar:
Jackknifing Documents and Additive Smoothing for Naive Bayes with Scarce Data. ICDM 2015: 91-100 - 2014
- [c19]Vinay Deolalikar:
Topological models of document-query sets in retrieval for Enterprise Information Management. IEEE BigData 2014: 18-23 - [c18]Vinay Deolalikar:
Feature selection for text clustering in limited memory using Monte Carlo wrapper. IEEE BigData 2014: 42-49 - [c17]Vinay Deolalikar, Kave Eshghi:
Lightweight approximate top-k for distributed settings. IEEE BigData 2014: 835-844 - [c16]Vinay Deolalikar:
Query revision during cluster based search on large unstructured corpora. IEEE BigData 2014: 845-853 - [c15]Vinay Deolalikar:
Can Corpus Similarity-Based Self-Annotation Assist Information Retrieval? ESAIR 2014: 13-15 - [c14]Vinay Deolalikar:
Distance or Coverage?: Retrieving Knowledge-Rich Documents From Enterprise Text Collections. CIKM 2014: 1771-1774 - [c13]Vinay Deolalikar:
Parameter Tuning with User Models: Influencing Aggregate User Behavior in Cluster Based Retrieval Systems. CIKM 2014: 1823-1826 - [c12]Vinay Deolalikar:
What is the Shape of a Cluster?: Structural Comparisons of Document Clusters. CIKM 2014: 1927-1930 - 2013
- [c11]Vinay Deolalikar:
Enterprise pre-sales forums: A preliminary study of metadata and content. IEEE BigData 2013: 1-4 - [c10]Vinay Deolalikar:
Paired-replicas with constant repair time: Loss functions and memorylessness. IEEE BigData 2013: 23-27 - [c9]Vinay Deolalikar:
Real-Time User-Centric Management of Time-Intensive Analytics Using Convergence of Local Functions. ICAC 2013: 167-173 - [c8]Vinay Deolalikar:
Characterization of Corpora from Enterprise Technology Creation for Retrieval and Mining. ICDM Workshops 2013: 365-369 - [c7]Vinay Deolalikar:
Most Clusters Can Be Retrieved with Short Disjunctive Queries. ICDM 2013: 1019-1024 - 2012
- [c6]Vinay Deolalikar, Kave Eshghi, Hernan Laffitte:
A Lightweight Distributed Order and Duplication Insensitive Algorithm for Approximate Top-k Queries using Order Statistics. COMAD 2012: 111
2000 – 2009
- 2009
- [c5]Vinay Deolalikar, Hernan Laffitte:
Provenance as Data Mining: Combining File System Metadata with Content Analysis. Workshop on the Theory and Practice of Provenance 2009 - [c4]Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, Vinay Deolalikar, Greg Trezis, Peter Camble:
Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality. FAST 2009: 111-123 - 2006
- [c3]Vinay Deolalikar, Malena R. Mesarina, John Recker, Salil Pradhan:
Perturbative Time and Frequency Allocations for RFID Reader Networks. EUC Workshops 2006: 392-402 - 2005
- [j5]Andrea Acquaviva, Tajana Simunic, Vinay Deolalikar, Sumit Roy:
Remote power control of wireless network interfaces. J. Embed. Comput. 1(3): 381-389 (2005) - [j4]Vinay Deolalikar, Joel David Hamkins
, Ralf Schindler:
P != NP cap co-NP for Infinite Time Turing Machines. J. Log. Comput. 15(5): 577-592 (2005) - [c2]Vinay Deolalikar, John Recker, Malena R. Mesarina, Salil Pradhan:
Optimal Scheduling for Networks of RFID Readers. EUC Workshops 2005: 1025-1035 - 2003
- [c1]Andrea Acquaviva, Tajana Simunic, Vinay Deolalikar, Sumit Roy:
Remote Power Control of Wireless Network Interfaces. PATMOS 2003: 369-378 - 2002
- [j3]Vinay Deolalikar:
A two-layer paradigm capable of forming arbitrary decision regions in input space. IEEE Trans. Neural Networks 13(1): 15-21 (2002) - 2001
- [j2]Kenneth W. Shum, Ilia Aleshnikov, P. Vijay Kumar, Henning Stichtenoth, Vinay Deolalikar:
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 47(6): 2225-2241 (2001) - [j1]Vinay Deolalikar:
Mapping Boolean functions with neural networks having binary weights and zero thresholds. IEEE Trans. Neural Networks 12(3): 639-642 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
