Sciweavers

437 search results - page 15 / 88
» Adaptivity and computational complexity in the numerical sol...
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Non-local Regularization of Inverse Problems
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
Gabriel Peyré, Laurent D. Cohen, Séb...
SIGGRAPH
2000
ACM
13 years 12 months ago
Adaptively sampled distance fields: a general representation of shape for computer graphics
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
Sarah F. Frisken Gibson, Ronald N. Perry, Alyn P. ...
JCB
2006
107views more  JCB 2006»
13 years 7 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
DCC
2004
IEEE
14 years 7 months ago
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
Martin Röder, Jean Cardinal, Raouf Hamzaoui
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
13 years 11 months ago
Adaptively choosing niching parameters in a PSO
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
Stefan Bird, Xiaodong Li