default search action
Sumeet Sandhu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c15]Sagnik Sarkar, Maulik Parmar, Sumeet Sandhu:
Entity Set Expansion for Detecting Fashion Trends. ICMLA 2019: 162-167 - 2011
- [c14]Chia-Hsiang Chen, Yejoong Kim
, Zhengya Zhang, David T. Blaauw, Dennis Sylvester, Helia Naeimi, Sumeet Sandhu:
A confidence-driven model for error-resilient computing. DATE 2011: 1608-1613
2000 – 2009
- 2007
- [j4]Özgür Oyman, J. Nicholas Laneman, Sumeet Sandhu:
Multihop Relaying for Broadband Wireless Mesh Networks: From Theory to Practice. IEEE Commun. Mag. 45(11): 116-122 (2007) - [j3]Feng Xue, Sumeet Sandhu:
Cooperation in a Half-Duplex Gaussian Diamond Relay Channel. IEEE Trans. Inf. Theory 53(10): 3806-3814 (2007) - [c13]Feng Xue, Sumeet Sandhu:
Performance of cooperation strategies for a diamond relay network. CISS 2007: 319-324 - [c12]Mohamad Charafeddine, Ozgur Oyman, Sumeet Sandhu:
System-Level Performance of Cellular Multihop Relaying with Multiuser Scheduling. CISS 2007: 631-636 - 2006
- [c11]Ozgur Oyman, Sumeet Sandhu:
A Shannon-Theoretic Perspective on Fading Multihop Networks. CISS 2006: 525-530 - [c10]Ozgur Oyman, Sumeet Sandhu:
Non-Ergodic Power-Bandwidth Tradeoff in Linear Multi-hop Networks. ISIT 2006: 1514-1518 - 2004
- [c9]Lei Shao, Sumeet Sandhu, Sumit Roy, Minnie Ho:
High rate space frequency block codes for next generation 802.11 WLANs. ICC 2004: 2995-2999 - 2003
- [c8]Lei Shao, Sumit Roy, Sumeet Sandhu:
Rate-one space frequency block codes with maximum diversity gain for MIMO-OFDM. GLOBECOM 2003: 809-813 - [c7]Sumeet Sandhu, Minnie Ho:
Analog combining of multiple receive antennas with OFDM. ICC 2003: 3428-3432 - 2002
- [c6]Sumeet Sandhu, Arogyaswami Paulraj, Krishna Pandit:
On non-linear space-time block codes. ICASSP 2002: 2417-2420 - [c5]Dhananjay Gore, Sumeet Sandhu, Arogyaswami Paulraj:
Delay diversity codes for frequency selective channels. ICC 2002: 1949-1953 - 2001
- [j2]Robert W. Heath Jr.
Antenna selection for spatial multiplexing systems with linear receivers. IEEE Commun. Lett. 5(4): 142-144 (2001) - [c4]Sumeet Sandhu, Arogyaswami Paulraj:
Unified design of linear space-time block codes. GLOBECOM 2001: 1073-1077 - [c3]Sumeet Sandhu, Arogyaswami Paulraj:
Union bound on error probability of linear space-time block codes. ICASSP 2001: 2473-2476 - [c2]Sumeet Sandhu, Robert W. Heath Jr.
Space-time block codes versus space-time trellis codes. ICC 2001: 1132-1136 - 2000
- [j1]Sumeet Sandhu, Arogyaswami Paulraj:
Space-time block codes: a capacity perspective. IEEE Commun. Lett. 4(12): 384-386 (2000)
1990 – 1999
- 1995
- [c1]Sumeet Sandhu, Oded Ghitza:
A comparative study of mel cepstra and EIH for phone classification under adverse conditions. ICASSP 1995: 409-412
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-08-05 20:12 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: