Sciweavers

10608 search results - page 672 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CORR
2009
Springer
74views Education» more  CORR 2009»
15 years 5 months ago
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kul...
ICIP
2009
IEEE
15 years 5 months ago
Main subject detection via adaptive feature selection
In this paper we present an algorithm which uses adaptive selection of low-level features for main subject detection. The algorithm first computes low-level features such as contr...
Cuong T. Vu, Damon M. Chandler
224
Voted
DAM
2011
15 years 2 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»
15 years 2 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...
207
Voted
ICASSP
2011
IEEE
14 years 11 months ago
Promoting convergence in multi-channel blind signal separation using PNLMS
The proportionate normalized least-mean squares (PNLMS) adaptation algorithm exploits the sparse nature of acoustic impulse responses and assigns adaptation gain proportional to t...
Muhammad Z. Ikram