Sciweavers

4949 search results - page 129 / 990
» Consistency and Set Intersection
Sort
View
ACM
1995
15 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
ECRTS
2004
IEEE
15 years 8 months ago
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
Rodolfo Pellizzoni, Giuseppe Lipari
LICS
2007
IEEE
15 years 10 months ago
A Dependent Set Theory
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Wojciech Moczydlowski
147
Voted
JMIV
2010
98views more  JMIV 2010»
15 years 3 months ago
Expectations of Random Sets and Their Boundaries Using Oriented Distance Functions
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape es...
Hanna K. Jankowski, Larissa I. Stanberry
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 11 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen