304 search results - page 30 / 61 » Dynamic ordered sets with exponential search trees |
JMLR
2006
13 years 8 months ago
2006
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...
BTW
2005
Springer
14 years 2 months ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
ENTCS
2002
13 years 8 months ago
2002
This paper presents a mechanism for dynamic reconfiguration of component-based applications and its fault tolerance strategy. The mechanism, named generic connector, allows compos...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...