2434 search results - page 30 / 487 » Algorithmic Randomness of Closed Sets |
132
click to vote
EWCBR
2006
Springer
15 years 5 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
WALCOM
2010
IEEE
15 years 9 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
106
click to vote
CCGRID
2005
IEEE
15 years 7 months ago
2005
IEEE
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
JC
2008
15 years 1 months ago
2008
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
109
click to vote
MFCS
1995
Springer
15 years 5 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...