Sciweavers

2527 search results - page 124 / 506
» Discrete optimization in computer vision
Sort
View
127
Voted
IPPS
1999
IEEE
15 years 8 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...
184
Voted
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 6 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
136
Voted
DSOM
2008
Springer
15 years 5 months ago
SYMIAN: A Simulation Tool for the Optimization of the IT Incident Management Process
Incident Management is the process through which IT support organizations manage to restore normal service operation after a service disruption. The complexity of IT support organi...
Claudio Bartolini, Cesare Stefanelli, Mauro Torton...
96
Voted
ICASSP
2007
IEEE
15 years 10 months ago
ICA-Based Algorithms Applied to Image Coding
Recently, Narozny et al [1] proposed a new viewpoint in variable high-rate transform coding. They showed that the problem of finding the optimal 1-D linear block transform for a ...
Michel Narozny, Michel Barret
ICCV
2009
IEEE
16 years 8 months ago
Higher-Order Gradient Descent by Fusion-Move Graph Cut
Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higherorder graph...
Hiroshi Ishikawa