Sciweavers

104 search results - page 12 / 21
» Witness (Delaunay) Graphs
Sort
View
ICCV
2003
IEEE
14 years 9 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
AAAI
2006
13 years 9 months ago
Inexact Matching of Ontology Graphs Using Expectation-Maximization
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
Prashant Doshi, Christopher Thomas
ECCC
2006
112views more  ECCC 2006»
13 years 7 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
CVPR
2005
IEEE
14 years 9 months ago
Object Detection Using 2D Spatial Ordering Constraints
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade
CDC
2009
IEEE
116views Control Systems» more  CDC 2009»
14 years 17 days ago
Translation control of a fleet circular formation of AUVs under finite communication range
— This work proposes a control algorithm to stabilize a circular formation of AUVs tracking a time-varying center. We also consider the problem of uniform distribution of all the...
Lara B. Arranz, Alexandre Seuret, Carlos Canudas d...