Sciweavers

1117 search results - page 56 / 224
» Equivalent Representations of Set Functions
Sort
View
JUCS
2002
90views more  JUCS 2002»
14 years 9 months ago
How Large is the Set of Disjunctive Sequences?
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
Ludwig Staiger
PG
2003
IEEE
15 years 2 months ago
Dynamic Sculpting and Deformation of Point Set Surfaces
This paper presents a novel paradigm for point set surface editing, which takes advantages of the potential of implicit surfaces, the strength of physics based modeling techniques...
Xiaohu Guo, Hong Qin
82
Voted
ICCV
2003
IEEE
15 years 2 months ago
Unsupervised Non-parametric Region Segmentation Using Level Sets
We present a novel non-parametric unsupervised segmentation algorithm based on Region Competition [21]; but implemented within a Level Sets framework [11]. The key novelty of the ...
Timor Kadir, Michael Brady
73
Voted
ESOP
2007
Springer
15 years 3 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
112
Voted
FUZZY
2004
Springer
170views Fuzzy Logic» more  FUZZY 2004»
15 years 3 months ago
Consistency Conditions for Fuzzy Choice Functions
The revealed preference is a central subject in classical consumer theory. Authors like Samuelson, Arrow, Richter, Sen, Uzawa and others have proposed an axiomatic setting of reve...
Irina Georgescu