982 search results - page 138 / 197 » Solving Steiner tree problems in graphs to optimality |
108
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
99
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
102
Voted
EUROGP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
89
Voted
STOC
2003
ACM
16 years 26 days ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
100
Voted
GCB
2004
Springer
15 years 6 months ago
2004
Springer
: To facilitate research in comparative genomics, sequencing projects are increasingly aimed at assembling the genomes of closely related organisms. Given two incomplete assemblies...