8768 search results - page 43 / 1754 » Generalizing the notion of support |
201
click to vote
WOB
2008
15 years 7 months ago
2008
Abstract. We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster....
167
click to vote
JAR
2007
15 years 6 months ago
2007
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
179
click to vote
ICML
1998
IEEE
16 years 7 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
164
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
135
click to vote
FOSSACS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...