666 search results - page 130 / 134 » Unbalanced Graph Cuts |
137
click to vote
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
ACIVS
2008
Springer
15 years 6 months ago
2008
Springer
Multi-view scene reconstruction from multiple uncalibrated images can be solved by two stages of processing: first, a sparse reconstruction using Structure From Motion (SFM), and ...
91
Voted
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
113
click to vote
WCRE
2006
IEEE
15 years 5 months ago
2006
IEEE
The understanding of the structure of a software system can be improved by analyzing the system’s evolution during development. Visualizations of software history that provide o...
91
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...