Sciweavers

937 search results - page 41 / 188
» On the Complexity of Partial Order Properties
Sort
View
ICPR
2006
IEEE
16 years 7 months ago
Generic Detection of Multi-Part Objects
A method is proposed to detect multi-part man-made or natural objects in complex images. It consists in first extracting simple curves and straight lines from the edge map. Then, ...
Jean-Francois Bernier, Robert Bergevin
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ECAL
2007
Springer
16 years 3 days ago
Spatial Embedding and Complexity: The Small-World Is Not Enough
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
Christopher L. Buckley, Seth Bullock
LICS
2012
IEEE
13 years 8 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
LICS
2002
IEEE
15 years 10 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...