Sciweavers

790 search results - page 78 / 158
» Subexponential Parameterized Algorithms
Sort
View
CGI
2009
IEEE
15 years 7 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang
MMSEC
2004
ACM
126views Multimedia» more  MMSEC 2004»
15 years 8 months ago
Key-dependency for a wavelet-based blind watermarking algorithm
When a host image is watermarked multiple times by the same algorithm collisions can occur. This makes it difficult for an image to host multiple watermarks. But this hosting is n...
Michael Brachtl, Andreas Uhl, Werner Dietl
NIPS
2007
15 years 4 months ago
Incremental Natural Actor-Critic Algorithms
We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic reinforcement learning m...
Shalabh Bhatnagar, Richard S. Sutton, Mohammad Gha...
137
Voted
JCC
2006
69views more  JCC 2006»
15 years 3 months ago
Dramatic performance enhancements for the FASTER optimization algorithm
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
Benjamin D. Allen, Stephen L. Mayo
FSTTCS
2007
Springer
15 years 9 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...