Sciweavers

6740 search results - page 401 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
FOCM
2007
76views more  FOCM 2007»
15 years 6 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
15 years 4 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu
CVPR
2009
IEEE
17 years 1 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
EMMCVPR
2003
Springer
15 years 12 months ago
Generalized Multi-camera Scene Reconstruction Using Graph Cuts
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
Vladimir Kolmogorov, Ramin Zabih, Steven J. Gortle...
CP
2000
Springer
15 years 11 months ago
Practical Investigation of Constraints with Graph Views
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
Tobias Müller