Sciweavers

7123 search results - page 122 / 1425
» The Ordered Set of Rough Sets
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Automatic Performance Debugging of SPMD Parallel Programs
Different from sequential programs, parallel programs possess their own characteristics which are difficult to analyze in the multi-process or multi-thread environment. This paper...
Xu Liu, Lin Yuan, Jianfeng Zhan, Bibo Tu, Dan Meng
RSCTC
2004
Springer
237views Fuzzy Logic» more  RSCTC 2004»
14 years 3 months ago
An Automated Multi-spectral MRI Segmentation Algorithm Using Approximate Reducts
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
Sebastian Widz, Kenneth Revett, Dominik Slezak
DM
1999
65views more  DM 1999»
13 years 9 months ago
Finite three dimensional partial orders which are not sphere orders
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
Stefan Felsner, Peter C. Fishburn, William T. Trot...
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 10 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
CIE
2007
Springer
14 years 4 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee