Sciweavers

1408 search results - page 69 / 282
» Dynamical Tensor Approximation
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 12 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
UAI
2004
13 years 11 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
FOGA
2011
13 years 1 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
CVPR
2004
IEEE
14 years 12 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
CISS
2008
IEEE
14 years 4 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell