Sciweavers

553 search results - page 32 / 111
» On Planar Path Transformation
Sort
View
ICPR
2008
IEEE
15 years 7 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
ICPR
2008
IEEE
15 years 7 months ago
Cellular automaton for ultra-fast watershed transform on GPU
In this paper we describe a cellular automaton (CA) used to perform the watershed transform in N-D images. Our method is based on image integration via the Ford-Bellman shortest p...
Claude Kauffmann, Nicolas Piche
SOSP
2003
ACM
15 years 9 months ago
Transforming policies into mechanisms with infokernel
We describe an evolutionary path that allows operating systems to be used in a more flexible and appropriate manner by higher-level services. An infokernel exposes key pieces of ...
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau,...
114
Voted
JGAA
2002
86views more  JGAA 2002»
15 years 10 days ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
83
Voted
CVPR
2006
IEEE
16 years 2 months ago
Off-road Path Following using Region Classification and Geometric Projection Constraints
We describe a realtime system for finding and tracking unstructured paths in off-road conditions. The system was designed as part of the recent Darpa Grand Challenge and was teste...
Yaniv Alon, Andras Ferencz, Amnon Shashua