464 search results - page 36 / 93 » Subsystem Based Generalizations of Rough Set Approximations |
103
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents an analysis of microarray gene expression data from patients with and without scleroderma skin disease using computational intelligence and visual data mining ...
129
Voted
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
108
click to vote
MICRO
1998
IEEE
15 years 1 months ago
1998
IEEE
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
87
Voted
STOC
2006
ACM
15 years 9 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...