Sciweavers

2542 search results - page 125 / 509
» One step ahead
Sort
View
JCT
2008
109views more  JCT 2008»
13 years 9 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 9 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
HCI
2009
13 years 7 months ago
Using Graphical Models for an Intelligent Mixed-Initiative Dialog Management System
The main goal of dialog management is to provide all information needed to perform e. g. a SQL-query, a navigation task, etc. Two principal approaches for dialog management systems...
Stefan Schwärzler, Günther Ruske, Frank ...
CVPR
1996
IEEE
14 years 11 months ago
A Factorization Method for Affine Structure from Line Correspondences
A family of structure from motion algorithms called the factorization method has been recently developed from the orthographic projection model to the afJine camera model [23, i6,...
Long Quan, Takeo Kanade
CVPR
2008
IEEE
14 years 11 months ago
Dense correspondence finding for parametrization-free animation reconstruction from video
We present a dense 3D correspondence finding method that enables spatio-temporally coherent reconstruction of surface animations from multi-view video data. Given as input a seque...
Naveed Ahmed, Christian Theobalt, Christian Rö...