Sciweavers

9405 search results - page 10 / 1881
» Computing a Model of Set Theory
Sort
View
ENTCS
2008
106views more  ENTCS 2008»
14 years 9 months ago
Computability and Representations of the Zero Set
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
Pieter Collins
IEEEICCI
2006
IEEE
15 years 3 months ago
Rough Set Method Based on Multi-Granulations
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
Y. H. Qian, J. Y. Liang
DBPL
2007
Springer
102views Database» more  DBPL 2007»
15 years 3 months ago
A Theory of Stream Queries
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
Yuri Gurevich, Dirk Leinders, Jan Van den Bussche
ICCS
2003
Springer
15 years 2 months ago
Generalized Jordan Sets in the Theory of Singular Partial Differential-Operator Equations
Michael V. Falaleev, Olga A. Romanova, Nicholas A....
URBAN
2008
128views more  URBAN 2008»
14 years 9 months ago
Discerning landslide susceptibility using rough sets
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
Pece V. Gorsevski, Piotr Jankowski