- Dyadic Classification Trees Structural Risk Minimization
- Rank Minimization over Finite Fields Vincent Y. F. Tan, Laura Balzano and Stark C. Draper
- Spring 2009 ECE 379 Introduction to Signals & Information Processing
- Online Identification and Tracking of Subspaces from Highly Incomplete Information
- Network Inference from Co-Occurrences Michael G. Rabbat, Mario A. T. Figueiredo, Robert D. Nowak,
- Near-Minimax Optimal Classification with Dyadic Classification Trees
- Platelets: A Multiscale Approach for Recovering Edges and Surfaces
- arXiv:1102.3887v1[cs.IT]18Feb2011 Active Clustering: Robust and Efficient
- Unlabeled data: Now it helps, now it doesn't Aarti Singh, Robert D. Nowak
- Noname manuscript No. (will be inserted by the editor)
- ERRATA for paper "Minimax Bounds for Active Learning" -In Rui M. Castro and Robert D. Nowak
- Minimax-Optimal Classification with Dyadic Decision Trees
- Simple Bounds for Low-complexity Model Reconstruction Emmanuel Cand`es and Benjamin Recht
- Using unitary operations to preserve quantum states in the presence of relaxation Benjamin Recht,
- TEMPLAR: A Wavelet-Based Framework for Pattern Learning and Analysis
- Adaptive Hausdorff Estimation of Density Level Sets
- 1322 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 10, NO. 9, SEPTEMBER 2001 Wavelet-Based Image Estimation
- De Novo Signaling Pathway Reconstruction From Multiple
- Detecting Weak but Hierarchically-Structured Patterns in Networks Aarti Singh
- Sample Complexity for 1-bit Compressed Sensing and Sparse Classification
- On the Success of Network Topology Inference using a Markov Random Walk Model for Nested Routing Policies
- OPTIMAL WEIGHTED HIGHPASS FILTERS USING MULTISCALE ANALYSIS
- Template Learning from Atomic Representations: A Wavelet-based
- Wavelet-Based Transformations for Nonlinear Signal Processing
- Dimensionality Reduction: beyond the Johnson-Lindenstrauss Yair Bartal
- University of California Los Angeles
- A Restricted Isometry Property for Structurally-Subsampled Unitary Matrices
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- SUBMITTED FOR PUBLICATION; 2007. 1 Gradient Projection for Sparse
- Multiscale Poisson Intensity and Density Estimation
- SUBMITTED FOR PUBLICATION; 2007. 1 Majorization-Minimization Algorithms for
- Blind Calibration of Sensor Networks Laura Balzano
- Matched Source-Channel Communication for Field Estimation in Wireless Sensor Networks
- arXiv:1001.5311v1[math.ST]29Jan2010 DISTILLED SENSING: ADAPTIVE SAMPLING FOR
- Finite sample analysis of semi-supervised learning Technical Report ECE-08-03
- !#"%$&'()10 23$& 45687 9@A0 BCD$E4 BF41 G !D5@HD45" D4 IP45Q$& R SUT $&'VW
- Learning Bigrams from Unigrams Xiaojin Zhu
- Network Inference from Co-Occurrences Michael G. Rabbat, Student Member, IEEE, Mario A. T. Figueiredo, Member, IEEE
- Minimax Optimal Level Set Estimation R. M. Willett, Member, IEEE, and R. D. Nowak, Senior Member, IEEE
- Backcasting: Adaptive Sampling for Sensor Networks Rebecca Willett, Aline Martin, and Robert Nowak
- Minimax Bounds for Active Learning Rui M. Castro1,2
- Necessary and Sufficient Conditions for Success of the Nuclear Norm Heuristic for Rank Minimization
- Causal Network Inference via Group Sparse Regularization
- Reputation-based Framework for High Integrity Sensor Networks
- GENOMIC NETWORK TOMOGRAPHY Michael G. Rabbat
- Space-Time Sparse Reconstruction for Magneto-/Electroencephalography
- Network Mapping and Measurement Conference 2011 Madison, Wisconsin
- Multi-Manifold Semi-Supervised Learning Computer Sciences Dept.
- Distributed Optimization in Sensor Networks Michael Rabbat and Robert Nowak
- Online Identification and Tracking of Subspaces from Highly Incomplete Information
- Blind Calibration of Sensor Networks Laura Balzano
- Active Sensing What is Active Sensing?
- Random Features for Large-Scale Kernel Machines Ali Rahimi and Ben Recht
- Using Machines to Improve Human Saliency Nikhil Rao, Joseph Harrison Tyler Karrels, Robert Nowak and Timothy T. Rogers
- Transduction with Matrix Completion: Three Birds with One Stone
- Sparse Interactions: Identifying High-Dimensional Multilinear Systems via Compressed Sensing
- High-Dimensional Matched Subspace Detection When Data are Missing
- Active Sensing and Learning Rui Castro and Robert Nowak
- The Geometry of Generalized Binary Search Robert D. Nowak
- Generalized Binary Search Robert Nowak, nowak@ece.wisc.edu
- Improved Approach to Lidar Airport Obstruction Surveying Using Full-Waveform Data
- Toeplitz Compressed Sensing Matrices with Applications to Sparse Channel Estimation
- Multiple Source Internet Tomography Michael G. Rabbat, Mark J. Coates, and Robert D. Nowak
- Journal of Machine Learning Research x (2006) xx Submitted 9/05; Published xx/xx Learning Minimum Volume Sets
- Network Radar: Tomography from Round Trip Time Measurements
- Multiple Source, Multiple Destination Network Tomography
- Sequential Monte Carlo Inference of Internal Delays in Nonstationary Communication Networks
- Designing Wireless Sensor Networks as a Shared Resource for Sustainable Development
- Design, Analysis, and Implementation of DVSR: A Fair, High Performance Protocol for Packet Rings
- Rapid Deployment with Confidence: Calibration and Fault Detection in Environmental Sensor Networks
- Parallel Stochastic Gradient Algorithms for Large-Scale Matrix Benjamin Recht and Christopher Re
- A Simpler Approach to Matrix Completion Benjamin Recht
- Accepted Manuscript Probability of Unique Integer Solution to a System of Linear Equations
- Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning
- Unsupervised Regression with applications to Nonlinear System Identification
- A Feature Space View of Spectral Clustering
- ECE 830 Fall 2010 Statistical Signal Processing instructor: R. Nowak , scribe: J. Jiao
- Crystallography Project --Final Goals and Objectives Due Sunday, May 1, 2005
- CONTROLLING THE ERROR IN FMRI: HYPOTHESIS TESTING OR SET ESTIMATION? Zachary Harmany and Rebecca Willett
- Robust Contour Matching via the Order Preserving Assignment Clayton Scott and Robert Nowak
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Crystallography Project --Task 1 Due Sunday March 27
- Uniform Approximation of Functions with Random Bases Ali Rahimi and Benjamin Recht
- Estimating Inhomogeneous Fields Using Wireless Sensor Networks
- Learning Minimum Volume Sets Clayton Scott
- Blind Calibration of Networks of Sensors: Theory and Algorithms
- Characterizing Decoding Robustness under Parametric Channel Uncertainty
- arXiv:1103.5991v1[math.ST]30Mar2011 Sequential Analysis in High Dimensional
- A Neyman-Pearson Approach to Statistical Learning Clayton Scott
- Quantized Incremental Algorithms for Distributed Optimization
- Learning to Transform Time Series with a Few Ali Rahimi, Ben Recht, Trevor Darrell
- Tight Measurement Bounds for Exact Recovery of Structured Sparse Signals
- The Geometry of Generalized Binary Search Robert D. Nowak
- Tight Measurement Bounds for Exact Recovery of Structured Sparse Signals
- CONVEX APPROACHES TO MODEL WAVELET SPARSITY PATTERNS Nikhil S. Rao, Robert D. Nowak, Stephen J. Wright
- Active Ranking using Pairwise Comparisons Kevin G. Jamieson
- Tight Clustering Condition 1. Introduction 3. Efficient Hierarchical Clustering
- GAUTAM DASARATHY dasarathy@wisc.edu 2110 University Avenue, Apt. #110
- High-Rank Matrix Completion and Subspace Clustering with Missing Data
- arXiv:1107.6027v2[cs.IT]28Feb2012 SUBMITTED TO IEEE TRANSACTIONS ON INFORMATION THEORY 1 Minimax-Optimal Bounds for Detectors
- arXiv:submit/0431972[cs.IT]8Mar2012 Near-Optimal Compressive Binary Search
- 504 IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, VOL. 59, NO. 2, FEBRUARY 2012 Cross Validation for Selection of Cortical Interaction
- Low-Dimensional Embedding using Adaptively Selected Ordinal Data
- k-Subspaces with Missing Data University of Wisconsin Technical Report ECE-11-02
- Quickest Search for a Rare Distribution Matthew L. Malloy
