default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhinav Ganesan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]Yaswanth Reddy, Sumanth Sadu, Abhinav Ganesan, Jose Mathew:
Address Location Correction System for Q-commerce. AIMLSystems 2022: 23:1-23:7- [c14]Tanya Khanna, Abhinav Ganesan, Jose Mathew, Kranthi Mitra Adusimilli:
Mining Entry Gates for Points of Interest. CIKM 2022: 4114-4117 - [c13]Gaurav Pawar, Abhinav Ganesan, Ritwik Prashant Moghe, Bharath Nayak, Tanya Khanna, Kranthi Mitra Adusimilli:
Learning to Predict Two-Wheeler Travel Distance. COMAD/CODS 2022: 153-161 - 2021
- [c12]Abhinav Ganesan, Anubhav Gupta, Jose Mathew:
Mining points of interest via address embeddings: an unsupervised approach. LocalRec@SIGSPATIAL 2021: 7:1-7:10 - [i9]Abhinav Ganesan, Anubhav Gupta, Jose Mathew:
Mining Points of Interest via Address Embeddings: An Unsupervised Approach. CoRR abs/2109.04467 (2021)
2010 – 2019
- 2017
- [j5]Abhinav Ganesan
, Sidharth Jaggi, Venkatesh Saligrama:
Learning Immune-Defectives Graph Through Group Tests. IEEE Trans. Inf. Theory 63(5): 3010-3028 (2017) - 2015
- [c11]Abhinav Ganesan, Sidharth Jaggi, Venkatesh Saligrama:
Learning immune-defectives graph through group tests. ISIT 2015: 66-70 - [c10]Abhinav Ganesan, Koteshwar Pavan Srinath:
Interference aligned space-time transmission with diversity for the 2 × 2 X-Network. ISIT 2015: 621-625 - [c9]Abhinav Ganesan, Sidharth Jaggi, Venkatesh Saligrama:
Non-adaptive group testing with inhibitors. ITW 2015: 1-5 - [i8]Abhinav Ganesan, K. Pavan Srinath:
Interference Aligned Space-Time Transmission with Diversity for the 2 × 2 X-Network. CoRR abs/1501.04775 (2015) - [i7]Abhinav Ganesan, Sidharth Jaggi, Venkatesh Saligrama:
Learning Immune-Defectives Graph through Group Tests. CoRR abs/1503.00555 (2015) - 2014
- [j4]Abhinav Ganesan, B. Sundar Rajan:
Interference Alignment With Diversity for the 2×2 X-Network With Four Antennas. IEEE Trans. Inf. Theory 60(6): 3576-3592 (2014) - [j3]Teja Damodaram Bavirisetti, Abhinav Ganesan, Prasad Krishnan, B. Sundar Rajan:
Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay. IEEE Trans. Inf. Theory 60(10): 6276-6302 (2014) - [j2]Abhinav Ganesan, B. Sundar Rajan:
On Precoding for Constant K-User MIMO Gaussian Interference Channel With Finite Constellation Inputs. IEEE Trans. Wirel. Commun. 13(8): 4104-4118 (2014) - [c8]Abhinav Ganesan, B. Sundar Rajan:
Interference alignment with diversity for the 2 × 2 X-Network with three antennas. ISIT 2014: 1216-1220 - [i6]Abhinav Ganesan, Javad Ebrahimi, Sidharth Jaggi, Venkatesh Saligrama:
Non-Adaptive Group Testing with Inhibitors. CoRR abs/1410.8440 (2014) - 2013
- [c7]Abhinav Ganesan, B. Sundar Rajan:
Interference alignment with diversity for the 2 × 2 X network with four antennas. GLOBECOM 2013: 1785-1790 - [c6]Abhinav Ganesan, B. Sundar Rajan:
On precoding for constant K-User MIMO Gaussian interference channel with finite constellation inputs. ICC 2013: 3068-3072 - [i5]Abhinav Ganesan, B. Sundar Rajan:
Interference Alignment with Diversity for the 2 × 2 X Network with four antennas. CoRR abs/1304.1432 (2013) - [i4]Abhinav Ganesan, B. Sundar Rajan:
Interference Alignment with Diversity for the 2 × 2 X-Network with three antennas. CoRR abs/1309.2473 (2013) - [i3]Teja Damodaram Bavirisetti, Abhinav Ganesan, Prasad Krishnan, B. Sundar Rajan:
Precoding Based Network Alignment using Transform Approach for Acyclic Networks with Delay. CoRR abs/1310.2809 (2013) - 2012
- [j1]Abhinav Ganesan, B. Sundar Rajan:
Two-User Gaussian Interference Channel with Finite Constellation Input and FDMA. IEEE Trans. Wirel. Commun. 11(7): 2496-2507 (2012) - [c5]Abhinav Ganesan, Teja Damodaram Bavirisetti, B. Sundar Rajan:
On the feasibility of Network Alignment for three-source three-destination multiple unicast networks with delays. GLOBECOM 2012: 2274-2279 - [c4]Abhinav Ganesan, B. Sundar Rajan:
On interference alignment for symmetrically connected interference networks with line of sight channels at finite powers. ICC 2012: 2255-2259 - [c3]Teja Damodaram Bavirisetti, Abhinav Ganesan, Prasad Krishnan, B. Sundar Rajan:
A transform approach to linear network coding for acyclic networks with delay. ISIT 2012: 1902-1906 - [i2]Abhinav Ganesan, Teja Damodaram Bavirisetti, B. Sundar Rajan:
On the Feasibility of Network Alignment for Three-Source Three-Destination Multiple Unicast Networks with Delays. CoRR abs/1203.5915 (2012) - [i1]Abhinav Ganesan, B. Sundar Rajan:
On Precoding for Constant K-User MIMO Gaussian Interference Channel with Finite Constellation Inputs. CoRR abs/1210.3819 (2012) - 2011
- [c2]Abhinav Ganesan, Teja Damodaram Bavirisetti, Prasad Krishnan, B. Sundar Rajan:
A generalized network alignment for three-source three-destination multiple unicast networks with delays. ITW 2011: 573-577 - [c1]Abhinav Ganesan, B. Sundar Rajan:
Capacity region of K-user discrete memoryless interference channels with a mixed strong-very strong interference. PIMRC 2011: 1880-1884
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 22:53 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:
