7123 search results - page 109 / 1425 » The Ordered Set of Rough Sets |
ICADL
2005
Springer
14 years 3 months ago
2005
Springer
This paper proposes a method for creating a high quality collection of researchers’ homepages. The proposed method consists of three phases: rough filtering of the possible web p...
GBRPR
2007
Springer
14 years 2 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
CONSTRAINTS
2007
13 years 10 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
SIAMCOMP
1998
13 years 9 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
APN
2011
Springer
13 years 1 months ago
2011
Springer
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...