Sciweavers

3838 search results - page 609 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
TMI
2008
85views more  TMI 2008»
14 years 10 months ago
Sparsity-Enforced Slice-Selective MRI RF Excitation Pulse Design
We introduce a novel algorithm for the design of fast slice-selective spatially-tailored magnetic resonance imaging (MRI) excitation pulses. This method, based on sparse approximat...
Adam C. Zelinski, Lawrence L. Wald, K. Setsompop, ...
CGF
2005
170views more  CGF 2005»
14 years 10 months ago
Structure Recovery via Hybrid Variational Surface Approximation
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...
Jianhua Wu, Leif Kobbelt
JOI
2007
99views more  JOI 2007»
14 years 10 months ago
Measuring quality of similarity functions in approximate data matching
This paper presents a method for assessing the quality of similarity functions. The scenario taken into account is that of approximate data matching, in which it is necessary to d...
Roberto da Silva, Raquel Kolitski Stasiu, Viviane ...
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
14 years 10 months ago
The explicit linear quadratic regulator for constrained systems
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimi...
Alberto Bemporad, Manfred Morari, Vivek Dua, Efstr...
JCO
1998
136views more  JCO 1998»
14 years 9 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...