Sciweavers

123 search results - page 24 / 25
» Robust binary least squares: Relaxations and algorithms
Sort
View
SIAMSC
2010
120views more  SIAMSC 2010»
13 years 3 months ago
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...
IPSN
2005
Springer
13 years 10 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
ISMAR
2003
IEEE
13 years 10 months ago
A real-time tracker for markerless augmented reality
Augmented Reality has now progressed to the point where real-time applications are being considered and needed. At the same time it is important that synthetic elements are render...
Andrew I. Comport, Éric Marchand, Fran&cced...
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
13 years 10 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...