Sciweavers

233 search results - page 11 / 47
» The Shapes of Trees
Sort
View
ICALP
1998
Springer
15 years 1 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
IJISTA
2007
88views more  IJISTA 2007»
14 years 9 months ago
Event triggered Holonic organisation formation
: Internet based distributed collaborative commerce must resolve two problems first. One is what organisation shape is and the other is how to establish an efficient and active org...
Mingwei Yuan, Ping Jiang, Zuren Feng
EMMCVPR
2001
Springer
15 years 2 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
ICIP
2009
IEEE
15 years 9 months ago
A Markov Random Field Model for Extracting Near-Circular Shapes
We propose a binary Markov Random Field (MRF) model that assigns high probability to regions in the image domain consisting of an unknown number of circles of a given radius. We...
Tamas Blaskovics, Zoltan Kato, and Ian Jermyn
AADEBUG
1997
Springer
15 years 1 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon