Sciweavers

2498 search results - page 227 / 500
» Algorithms for the Topological Watershed
Sort
View
COMSNETS
2012
199views more  COMSNETS 2012»
14 years 2 months ago
Varanus: More-with-less fault localization in data centers
Abstract—Detecting and localizing performance faults is crucial for operating large enterprise data centers. This problem is relatively straightforward to solve if each entity (a...
Vaishali P. Sadaphal, Maitreya Natu, Harrick M. Vi...
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 2 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
IPMI
2005
Springer
16 years 7 months ago
Design of Robust Vascular Tree Matching: Validation on Liver
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
Arnaud Charnoz, Vincent Agnus, Grégoire Mal...
GBRPR
2009
Springer
16 years 1 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink