Sciweavers

4860 search results - page 417 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
IPL
2010
92views more  IPL 2010»
15 years 2 months ago
Learning parities in the mistake-bound model
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
Harry Buhrman, David García-Soriano, Arie M...
MICCAI
2010
Springer
15 years 1 months ago
Efficient MR Image Reconstruction for Compressed MR Imaging
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas
DAM
2011
14 years 10 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
TIT
2010
154views Education» more  TIT 2010»
14 years 10 months ago
A universal scheme for Wyner-Ziv coding of discrete sources
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
Shirin Jalali, Sergio Verdú, Tsachy Weissma...
ICASSP
2011
IEEE
14 years 7 months ago
On the design of matched orthonormal wavelets with compact support
We develop new algorithms for designing matched wavelets and matched scaling functions using a new parametrization of compactly supported orthonormal wavelets that is developed in...
Mohamed F. Mansour