A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
— In this paper a new strategy for handling the observation information of a bearing-range sensor throughout the filtering process of EKF-SLAM is proposed. This new strategy is ...
Amir Hossein Tamjidi, Hamid D. Taghirad, Ali Akbar...