Sciweavers

556 search results - page 1 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
FUIN
2002
117views more  FUIN 2002»
13 years 4 months ago
A Comparative Study of Some Generalized Rough Approximations
In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive rela...
Anna Gomolinska
RSCTC
2000
Springer
146views Fuzzy Logic» more  RSCTC 2000»
13 years 8 months ago
Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts
Abstract. We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relation...
Maciej Borkowski, Dominik Slezak
ACL
1998
13 years 6 months ago
Some Properties of Preposition and Subordinate Conjunction Attachments
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
Alexander S. Yeh, Marc B. Vilain
DISOPT
2010
132views more  DISOPT 2010»
13 years 4 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ACM
1995
13 years 8 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak