Sciweavers

4913 search results - page 279 / 983
» Results and Perspectives of the G
Sort
View
TSE
2010
102views more  TSE 2010»
15 years 1 months ago
Understanding Exception Handling: Viewpoints of Novices and Experts
Several recent studies indicate that many industrial applications exhibit poor quality in the design of exception-handling. To improve the quality of error-handling, we need to und...
Hina Shah, Carsten Görg, Mary Jean Harrold
ICASSP
2011
IEEE
14 years 10 months ago
Feature-based global motion estimation using the Helmholtz principle
Global motion estimation is an important task for various video processing techniques. The estimation itself has to be robust in presence of arbitrarily moving foreground objects....
Michael Tok, Alexander Glantz, Andreas Krutz, Thom...
CVPR
2012
IEEE
13 years 9 months ago
Geometry constrained sparse coding for single image super-resolution
The choice of the over-complete dictionary that sparsely represents data is of prime importance for sparse codingbased image super-resolution. Sparse coding is a typical unsupervi...
Xiaoqiang Lu, Haoliang Yuan, Pingkun Yan, Yuan Yua...
ADAEUROPE
2004
Springer
16 years 4 days ago
On the Tree Width of Ada Programs
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...
JSAC
2008
98views more  JSAC 2008»
15 years 6 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri