18 search results - page 2 / 4 » Alignment-free local structural search by writhe decompositi... |
102
Voted
JMLR
2008
15 years 15 days ago
2008
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
82
Voted
EMMCVPR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which on...
143
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
106
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
117
click to vote
AMAST
2004
Springer
15 years 6 months ago
2004
Springer
concerns, abstraction (particularly hierarchical abstraction), simplicity, and restricted visibility (locality of information). The overall goal behind these principles was stated ...