Sciweavers

7 search results - page 1 / 2
» Maximizing an interval order on compact subsets of its domai...
Sort
View
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
13 years 4 months ago
Maximizing an interval order on compact subsets of its domain
Maximal elements of a binary relation on compact subsets of a metric space define a choice function. An infinite extension of transitivity is necessary and sufficient for such a c...
Nikolai S. Kukushkin
DAM
2008
72views more  DAM 2008»
13 years 4 months ago
On the existence of maximal elements: An impossibility theorem
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
Nikolai S. Kukushkin
TCS
2008
13 years 4 months ago
Motif patterns in 2D
Motif patterns consisting of sequences of intermixed solid and don't care characters have been introduced and studied in connection with pattern discovery problems of computa...
Alberto Apostolico, Laxmi Parida, Simona E. Rombo
LICS
2007
IEEE
13 years 10 months ago
On Noetherian Spaces
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
Jean Goubault-Larrecq
FSS
2010
111views more  FSS 2010»
13 years 3 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin