Sciweavers

1117 search results - page 29 / 224
» Equivalent Representations of Set Functions
Sort
View
97
Voted
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 6 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
130
Voted
MICCAI
2003
Springer
16 years 1 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
101
Voted
TCS
2008
15 years 18 days 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
15 years 2 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...
116
Voted
CVPR
2008
IEEE
15 years 7 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