2434 search results - page 354 / 487 » Algorithmic Randomness of Closed Sets |
150
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
128
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
151
Voted
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
128
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: Clustering the ESTs from a large dataset representing a single species is a convenient starting point for a number of investigations into gene discovery, genome evolut...
133
Voted
SIAMJO
2002
15 years 3 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...