Sciweavers

620 search results - page 27 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
TMI
2008
67views more  TMI 2008»
15 years 1 months ago
A Fast Method for Designing Time-Optimal Gradient Waveforms for Arbitrary k-Space Trajectories
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
Michael Lustig, Seung-Jean Kim, John M. Pauly
WSCG
2004
159views more  WSCG 2004»
15 years 3 months ago
A Fast Method for Applying Rigid Transformations to Volume Data
Volume rendering is a widespread method for displaying graphical models in fields such as medical visualization or engineering. The required image information is stored in a volum...
Jan Fischer, Ángel del Río
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
15 years 1 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
CEC
2009
IEEE
15 years 5 months ago
Direct and explicit building blocks identification and composition algorithm
— This paper proposes a new algorithm to identify and compose building blocks based on minimum mutual information criterion. Building blocks are interpreted as common subsequence...
Chalermsub Sangkavichitr, Prabhas Chongstitvatana
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 7 months ago
SWAF: Swarm Algorithm Framework for Numerical Optimization
A swarm algorithm framework (SWAF), realized by agent-based modeling, is presented to solve numerical optimization problems. Each agent is a bare bones cognitive architecture, whic...
Xiao-Feng Xie, Wenjun Zhang