Sciweavers

216 search results - page 29 / 44
» A hybrid exact algorithm for complete set partitioning
Sort
View
FROCOS
2007
Springer
14 years 1 months ago
Temporal Logic with Capacity Constraints
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
Clare Dixon, Michael Fisher, Boris Konev
COMPGEOM
2001
ACM
13 years 11 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
SCALESPACE
2001
Springer
13 years 12 months ago
Bayesian Object Detection through Level Curves Selection
Bayesian statistical theory is a convenient way of taking a priori information into consideration when inference is made from images. In Bayesian image detection, the a priori dist...
Charles Kervrann
VMV
2001
132views Visualization» more  VMV 2001»
13 years 8 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
14 years 1 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang