16430 search results - page 36 / 3286 » On Computable Tree Functions |
ICML
2004
IEEE
15 years 11 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
64
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
ISPEC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
82
Voted
ICCNMC
2005
Springer
15 years 3 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
ACL
2001
14 years 11 months ago
2001
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...