963 search results - page 56 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
ICPR
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
102
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
DAC
1995
ACM
15 years 3 months ago
1995
ACM
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signi...
104
click to vote
IPMI
2007
Springer
16 years 20 days ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
100
click to vote
WIOPT
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...