Sciweavers

1149 search results - page 19 / 230
» Minimally non-Pfaffian graphs
Sort
View
ICIAR
2007
Springer
14 years 3 months ago
Landmark-Based Non-rigid Registration Via Graph Cuts
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
Herve Lombaert, Yiyong Sun, Farida Cheriet
CVPR
2009
IEEE
15 years 4 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
CATS
2008
13 years 11 months ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
ICC
2008
IEEE
108views Communications» more  ICC 2008»
14 years 4 months ago
Minimizing Interferences in Wireless Ad Hoc Networks through Topology Control
— This paper investigates minimizing mutual interferences in wireless ad hoc networks by means of topology control. Prior work defines interference as a relationship between link...
Guinian Feng, Soung Chang Liew, Pingyi Fan
ICFCA
2005
Springer
14 years 3 months ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...