Sciweavers

59 search results - page 11 / 12
» Parametric Representations of Boolean Constraints
Sort
View
KBSE
2005
IEEE
13 years 11 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
13 years 9 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
AIIA
2005
Springer
13 years 11 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
VISUALIZATION
1997
IEEE
13 years 9 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber
CG
2008
Springer
13 years 5 months ago
Masked photo blending: Mapping dense photographic data set on high-resolution sampled 3D models
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...
Marco Callieri, Paolo Cignoni, Massimiliano Corsin...