982 search results - page 123 / 197 » Solving Steiner tree problems in graphs to optimality |
103
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Hierarchical topic taxonomies have proliferated on the World Wide Web [5, 18], and exploiting the output space decompositions they induce in automated classification systems is an...
DAC
2000
ACM
16 years 1 months ago
2000
ACM
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...
108
Voted
MVA
2007
15 years 2 months ago
2007
In the last few years, computer vision and image processing techniques have been developed to solve many problems. One of them, graph cut method is powerful optimization technique...
92
Voted
DAC
1996
ACM
15 years 4 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
95
Voted
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...