Sciweavers

5889 search results - page 456 / 1178
» Graph Layout Problems
Sort
View
ICPR
2008
IEEE
16 years 2 months ago
Medical image segmentation via min s-t cuts with sides constraints
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
Jiun-Hung Chen, Linda G. Shapiro
CONTEXT
2007
Springer
16 years 1 months ago
Context Modeling: Task Model and Practice Model
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...
Patrick Brézillon
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 1 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
HYBRID
2010
Springer
16 years 21 days ago
Distributed Kalman Filter algorithms for self-localization of mobile devices
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
Anne-Kathrin Hess, Anders Rantzer
CVPR
1999
IEEE
15 years 12 months ago
Detecting and Tracking Moving Objects for Video Surveillance
We address the problem of detection and tracking of moving objects in a video stream obtained from a moving airborne platform. The proposed method relies on a graph representation...
Isaac Cohen, Gérard G. Medioni