Sciweavers

1117 search results - page 29 / 224
» Equivalent Representations of Set Functions
Sort
View
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 3 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
MICCAI
2003
Springer
15 years 10 months ago
User-Aided Boundary Delineation through the Propagation of Implicit Representations
In this paper we introduce user-defined segmentation constraints within the level set methods. Snake-driven methods are powerful and widely explored techniques for object extractio...
Nikos Paragios
TCS
2008
14 years 9 months ago
On a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
Miguel Couceiro, Maurice Pouzet
CLA
2007
14 years 11 months ago
A New Concise Representation of Frequent Patterns through Disjunctive Search Space
The interest in a further pruning of the set of frequent patterns that can be drawn from real-life datasets is growing up. In fact, it is a quite survival reflex towards providing...
Tarek Hamrouni, Islem Denden, Sadok Ben Yahia, Eng...
CVPR
2008
IEEE
15 years 4 months ago
Learning a geometry integrated image appearance manifold from a small training set
While low-dimensional image representations have been very popular in computer vision, they suffer from two limitations: (i) they require collecting a large and varied training se...
Yilei Xu, Amit K. Roy Chowdhury