Sciweavers

15485 search results - page 643 / 3097
» Computing Optimal Subsets
Sort
View
GG
2008
Springer
15 years 8 months ago
Open Petri Nets: Non-deterministic Processes and Compositionality
We introduce ranked open nets, a reactive extension of Petri nets which generalises a basic open net model introduced in a previous work by allowing for a refined notion of interf...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Bar...
CVPR
2010
IEEE
15 years 7 months ago
Delineating trees in noisy 2D images and 3D image-stacks
We present a novel approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ou...
Germán González, Engin Türetken...
ICPR
2010
IEEE
15 years 7 months ago
A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
Gerard Sanromà, René Alquézar...
COMGEO
2008
ACM
15 years 7 months ago
On the density of iterated line segment intersections
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
Ansgar Grüne, Sanaz Kamali
DCG
2010
137views more  DCG 2010»
15 years 7 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray