Sciweavers

874 search results - page 82 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
CGF
1998
128views more  CGF 1998»
14 years 9 months ago
Multiresolution Isosurface Extraction with Adaptive Skeleton Climbing
An isosurface extraction algorithm which can directly generate multiresolution isosurfacesfrom volume data is introduced. It generates low resolution isosurfaces, with 4 to 25 tim...
Tim Poston, Tien-Tsin Wong, Pheng-Ann Heng
ACL
2010
14 years 8 months ago
Efficient Staggered Decoding for Sequence Labeling
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
Nobuhiro Kaji, Yasuhiro Fujiwara, Naoki Yoshinaga,...
ICML
2007
IEEE
15 years 10 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
CEC
2008
IEEE
15 years 4 months ago
On the scalability of particle swarm optimisation
— Particle swarm has proven to be competitive to other evolutionary algorithms in the field of optimization, and in many cases enables a faster convergence to the ideal solution...
Sébastien Piccand, Michael O'Neill, Jacquel...
FMCAD
2007
Springer
15 years 4 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton