2219 search results - page 56 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
ICCV
2007
IEEE
15 years 2 days ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
IWOCA
2009
Springer
14 years 4 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
WOSP
1998
ACM
14 years 2 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
ICPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Given a sequence of observable features of a linear dynamical system (LDS), we propose the problem of finding a representation of the LDS which is sparse in terms of a given dict...