default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadu V. Balan
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Lei Zhang, Xiaoke Wang, Michael G. Rawson, Radu V. Balan
, Edward H. Herskovits, Elias R. Melhem, Linda Chang, Ze Wang, Thomas Ernst:
Motion Correction for Brain MRI Using Deep Learning and a Novel Hybrid Loss Function. Algorithms 17(5): 215 (2024)- 2022
- [j12]Radu V. Balan, Chris B. Dock:
Lipschitz Analysis of Generalized Phase Retrievable Matrix Frames. SIAM J. Matrix Anal. Appl. 43(3): 1518-1571 (2022) - [c21]Sahil Sidheekh, Chris B. Dock, Tushar Jain, Radu V. Balan, Maneesh Kumar Singh:
VQ-Flows: Vector quantized local normalizing flows. UAI 2022: 1835-1845 - [i9]Radu V. Balan, Naveed Haghani, Maneesh Singh:
Permutation Invariant Representations with Applications to Graph Deep Learning. CoRR abs/2203.07546 (2022) - [i8]Sahil Sidheekh, Chris B. Dock, Tushar Jain, Radu V. Balan, Maneesh Kumar Singh:
VQ-Flows: Vector Quantized Local Normalizing Flows. CoRR abs/2203.11556 (2022) - 2020
- [j11]Dongmian Zou, Radu V. Balan, Maneesh Singh:
On Lipschitz Bounds of General Convolutional Neural Networks. IEEE Trans. Inf. Theory 66(3): 1738-1759 (2020) - [j10]Addison W. Bohannon, Vernon J. Lawhern, Nicholas R. Waytowich, Radu V. Balan:
The Autoregressive Linear Mixture Model: A Time-Series Model for an Instantaneous Mixture of Network Processes. IEEE Trans. Signal Process. 68: 4481-4496 (2020)
2010 – 2019
- 2018
- [c20]Addison W. Bohannon, Brian M. Sadler, Radu V. Balan:
Learning Flexible Representations of Stochastic Processes on Graphs. DSW 2018: 61-65 - [i7]Dongmian Zou, Radu V. Balan, Maneesh Singh:
On Lipschitz Bounds of General Convolutional Neural Networks. CoRR abs/1808.01415 (2018) - 2017
- [i6]Radu V. Balan, Maneesh Singh, Dongmian Zou:
Lipschitz Properties for Deep Convolutional Networks. CoRR abs/1701.05217 (2017) - 2016
- [j9]Radu V. Balan:
Reconstruction of Signals from Magnitudes of Redundant Representations: The Complex Case. Found. Comput. Math. 16(3): 677-721 (2016) - 2014
- [i5]Radu V. Balan, Dongmian Zou:
Phase Retrieval using Lipschitz Continuous Maps. CoRR abs/1403.2301 (2014) - 2013
- [c19]Yenming M. Lai, Radu V. Balan, Heiko Claussen, Justinian Rosca:
Optimal beam pattern design for very large sensor arrays with sparse sampling. ACSSC 2013: 949-953 - [c18]Yenming M. Lai, Radu V. Balan, Heiko Claussen, Justinian P. Rosca:
Broadband sensor location selection using convex optimization in very large scale arrays. WASPAA 2013: 1-4 - 2012
- [c17]Max Scharrenbroich, Michael Zatman, Radu V. Balan:
Performance of a practical two-step detector for non-fluctuating targets. SAM 2012: 313-316 - 2011
- [c16]Max Scharrenbroich, Michael Zatman, Radu V. Balan:
Cooperative radar techniques: The two-step detector. ACSCC 2011: 1975-1979 - 2010
- [c15]Radu V. Balan:
On signal reconstruction from its spectrogram. CISS 2010: 1-4
2000 – 2009
- 2009
- [j8]Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz, Radu V. Balan:
Energy-efficient resource allocation in wireless networks with quality-of-service constraints. IEEE Trans. Commun. 57(11): 3406-3414 (2009) - 2008
- [c14]Radu V. Balan:
Information theory based estimator of the number of sources in a sparse linear mixing model. CISS 2008: 269-273 - [c13]Bernhard G. Bodmann, Peter G. Casazza, Dan Edidin, Radu V. Balan:
Frames for linear reconstruction without phase. CISS 2008: 721-726 - 2007
- [j7]Radu V. Balan, Peter G. Casazza, Dan Edidin:
Equivalence of Reconstruction From the Absolute Value of the Frame Coefficients to a Sparse Representation Problem. IEEE Signal Process. Lett. 14(5): 341-343 (2007) - [c12]Radu V. Balan:
Estimator for Number of Sources Using Minimum Description Length Criterion for Blind Sparse Source Mixtures. ICA 2007: 333-340 - [c11]Ningping Fan, Justinian Rosca, Radu V. Balan:
Speech Noise Estimation using Enhanced Minima Controlled Recursive Averaging. ICASSP (4) 2007: 581-584 - [i4]Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz, Radu V. Balan:
Energy-Efficient Resource Allocation in Wireless Networks with Quality-of-Service Constraints. CoRR abs/0704.3880 (2007) - 2006
- [j6]Radu V. Balan, Yonina C. Eldar, Thomas Strohmer:
Frames and Overcomplete Representations in Signal Processing, Communications, and Information Theory. EURASIP J. Adv. Signal Process. 2006 (2006) - [c10]Radu V. Balan, Justinian P. Rosca:
Convolutive Demixing with Sparse Discrete Prior Models for Markov Sources. ICA 2006: 544-551 - [c9]Radu V. Balan, Justinian Rosca:
Source Separation Using Sparse Discrete Prior Models. ICASSP (4) 2006: 1113-1116 - [c8]Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz, Radu V. Balan:
Energy-efficient power and rate control with QoS constraints: a game-theoretic approach. IWCMC 2006: 1435-1440 - [i3]Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz, Radu V. Balan:
Energy Efficiency and Delay Quality-of-Service in Wireless Networks. CoRR abs/cs/0601098 (2006) - [i2]Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz, Radu V. Balan:
Energy-Efficient Power and Rate Control with QoS Constraints: A Game-Theoretic Approach. CoRR abs/cs/0604082 (2006) - 2005
- [j5]Radu V. Balan, H. Vincent Poor, Scott T. Rickard, Sergio Verdú:
Canonical time-frequency, time-scale, and frequency-scale representations of time-varying channels. Commun. Inf. Syst. 5(2): 197-226 (2005) - [j4]Radu V. Balan, Justinian Rosca, Scott Rickard:
Equivalence principle for optimization of sparse versus low-spread representations for signal estimation in noise. Int. J. Imaging Syst. Technol. 15(1): 10-17 (2005) - [c7]Ningping Fan, Justinian P. Rosca, Radu V. Balan:
Speaker Verification with Combined Threshold, Identification Front-End, and UBM. AutoID 2005: 112-117 - [i1]Scott T. Rickard, Radu V. Balan, H. Vincent Poor, Sergio Verdú:
Canonical time-frequency, time-scale, and frequency-scale representations of time-varying channels. CoRR abs/cs/0510085 (2005) - 2004
- [c6]Radu V. Balan, H. Vincent Poor, Scott T. Rickard, Sergio Verdú:
Time-frequency and time-scale canonical representations of doubly spread channels. EUSIPCO 2004: 445-448 - [c5]Liang Hong, Justinian Rosca, Radu V. Balan:
Bayesian single channel speech enhancement exploiting sparseness in the ICA domain. EUSIPCO 2004: 1713-1716 - [c4]Justinian Rosca, Christian Borß, Radu V. Balan:
Generalized sparse signal mixing model and application to noisy blind source separation. ICASSP (3) 2004: 877-880 - 2003
- [j3]Radu V. Balan, Peter G. Casazza, Christopher Heil, Zeph Landau:
Deficits and Excesses of Frames. Adv. Comput. Math. 18(2-4): 93-116 (2003) - [c3]Justinian Rosca, Radu V. Balan, Christophe Beaugeant:
Multi-channel psychoacoustically motivated speech enhancement. ICASSP (1) 2003: 84-87 - [c2]Radu V. Balan, Justinian Rosca, Scott Rickard:
Scalable non-square blind source separation in the presence of noise. ICASSP (5) 2003: 293-296 - [c1]Justinian P. Rosca, Radu V. Balan, Christophe Beaugeant:
Multi-channel psychoacoustically motivated speech enhancement. ICME 2003: 217-220 - 2000
- [j2]Radu V. Balan, Gabriel Taubin:
3D mesh geometry filtering algorithms for progressive transmission schemes. Comput. Aided Des. 32(13): 825-846 (2000) - [j1]Radu V. Balan, Ingrid Daubechies, Vinay A. Vaishampayan:
The analysis and design of windowed Fourier frame based multiple description source coding schemes. IEEE Trans. Inf. Theory 46(7): 2491-2536 (2000)
Coauthor Index
aka: Justinian Rosca
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-02 20:18 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:
