Sciweavers

3757 search results - page 182 / 752
» The overlap number of a graph
Sort
View
ICRA
2003
IEEE
158views Robotics» more  ICRA 2003»
15 years 11 months ago
Probabilistic cooperative localization and mapping in practice
In this paper we present a probabilistic framework for the reduction in the uncertainty of a moving robot pose during exploration by using a second robot to assist. A Monte Carlo ...
Ioannis M. Rekleitis, Gregory Dudek, Evangelos E. ...
MICCAI
2009
Springer
15 years 11 months ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eļ¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
DMDW
2000
173views Management» more  DMDW 2000»
15 years 7 months ago
A quality-based framework for physical data warehouse design
Data warehousing is a software infrastructure which supports OLAP applications by providing a collection of tools which allow data extraction and cleaning, data integration and ag...
Mokrane Bouzeghoub, Zoubida Kedad
JACM
2007
115views more  JACM 2007»
15 years 6 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
TIT
2008
122views more  TIT 2008»
15 years 6 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg