Sciweavers

4486 search results - page 206 / 898
» Adaptable Boundary Sets
Sort
View
SIP
2001
15 years 8 months ago
Marching ridges
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measureme...
Jacob D. Furst, Stephen M. Pizer
KDID
2003
119views Database» more  KDID 2003»
15 years 8 months ago
Generalized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
Ulrich Rückert, Stefan Kramer
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
15 years 8 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
IJCV
2006
105views more  IJCV 2006»
15 years 7 months ago
A Metric Approach to Vector-Valued Image Segmentation
We address the issue of low-level segmentation of vector-valued images, focusing on the case of color natural images. The proposed approach relies on the formulation of the problem...
Pablo Andrés Arbeláez, Laurent D. Co...
DM
2002
92views more  DM 2002»
15 years 7 months ago
A local-global principle for vertex-isoperimetric problems
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
Sergei L. Bezrukov, Oriol Serra