Sciweavers

3367 search results - page 323 / 674
» Incremental assignment problem
Sort
View
CVPR
2009
IEEE
16 years 12 months ago
Learning a Distance Metric from Multi-instance Multi-label Data
Multi-instance multi-label learning (MIML) refers to the learning problems where each example is represented by a bag/collection of instances and is labeled by multiple labels. ...
Rong Jin (Michigan State University), Shijun Wang...
ICCV
1999
IEEE
16 years 6 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
PODC
2005
ACM
15 years 10 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
ACCV
2010
Springer
14 years 11 months ago
A Unified Approach to Segmentation and Categorization of Dynamic Textures
Dynamic textures (DT) are videos of non-rigid dynamical objects, such as fire and waves, which constantly change their shape and appearance over time. Most of the prior work on DT ...
Avinash Ravichandran, Paolo Favaro, René Vi...
CP
2011
Springer
14 years 4 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny