Sciweavers

1395 search results - page 247 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
JDA
2007
129views more  JDA 2007»
13 years 8 months ago
Approximating the k-traveling repairman problem with repairtimes
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
Raja Jothi, Balaji Raghavachari
ICCV
1999
IEEE
14 years 10 months ago
Segmentation of Salient Closed Contours from Real Images
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
Shyjan Mahamud, Karvel K. Thornber, Lance R. Willi...
ICIP
2000
IEEE
14 years 10 months ago
Image Registration with Minimum Spanning Tree Algorithm
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
Bing Ma, Alfred O. Hero III, John D. Gorman, Olivi...
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
14 years 9 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth
ICPR
2004
IEEE
14 years 9 months ago
Landscape of Clustering Algorithms
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
Anil K. Jain, Alexander P. Topchy, Martin H. C. La...