18 search results - page 3 / 4 » Alignment-free local structural search by writhe decompositi... |
BMCBI
2008
13 years 5 months ago
2008
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
SCIA
2009
Springer
14 years 9 days ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
JAIR
2006
13 years 5 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
FSTTCS
2007
Springer
13 years 12 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
KDD
2001
ACM
14 years 6 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...