Sciweavers

5624 search results - page 591 / 1125
» On Conditional Covering Problem
Sort
View
DAGM
2011
Springer
14 years 6 months ago
Putting MAP Back on the Map
Conditional Random Fields (CRFs) are popular models in computer vision for solving labeling problems such as image denoising. This paper tackles the rarely addressed but important ...
Patrick Pletscher, Sebastian Nowozin, Pushmeet Koh...
CVPR
2012
IEEE
13 years 9 months ago
Joint 2D-3D temporally consistent semantic segmentation of street scenes
In this paper we propose a novel Conditional Random Field (CRF) formulation for the semantic scene labeling problem which is able to enforce temporal consistency between consecuti...
Georgios Floros, Bastian Leibe
AAAI
2012
13 years 9 months ago
Optimal Proportional Cake Cutting with Connected Pieces
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
BMVC
2010
15 years 4 months ago
Person Re-Identification by Support Vector Ranking
Solving the person re-identification problem involves matching observations of individuals across disjoint camera views. The problem becomes particularly hard in a busy public sce...
Bryan Prosser, Wei-Shi Zheng, Shaogang Gong, Tao X...
ECEASST
2006
103views more  ECEASST 2006»
15 years 6 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco