697 search results - page 99 / 140 » Decomposition Structures for Event-B |
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
LSSC
2005
Springer
15 years 5 months ago
2005
Springer
We propose a new class of Discontinuous Galerkin (DG) methods based on variational multiscale ideas. Our approach begins with an additive decomposition of the discontinuous finite...
100
click to vote
CVRMED
1995
Springer
15 years 3 months ago
1995
Springer
This paper presents a technique for the segmentation of anatomic structures in medical images using a topologically adaptable snakes model. The model is set in the framework of dom...
111
click to vote
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
113
click to vote
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...