Sciweavers

427 search results - page 41 / 86
» A Graph Based Synthesis Algorithm for Solving CSPs
Sort
View
ICIP
2009
IEEE
13 years 6 months ago
Optical flow and depth from motion for omnidirectional images using a TV-L1 variational framework on graphs
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
Luigi Bagnato, Pascal Frossard, Pierre Vandergheyn...
JMLR
2010
158views more  JMLR 2010»
13 years 3 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
ICCAD
2005
IEEE
128views Hardware» more  ICCAD 2005»
14 years 5 months ago
Reducing structural bias in technology mapping
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
FLAIRS
2003
13 years 10 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
ICPP
2005
IEEE
14 years 2 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann