Sciweavers

5247 search results - page 502 / 1050
» Frequency Optimized Computation Methods
Sort
View
151
Voted
DAGM
2009
Springer
15 years 5 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
ICCV
2003
IEEE
16 years 6 months ago
Spectral Partitioning for Structure from Motion
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
Drew Steedly, Irfan A. Essa, Frank Dellaert
175
Voted
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 5 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
15 years 11 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra
DAC
1999
ACM
16 years 5 months ago
A Practical Gate Resizing Technique Considering Glitch Reduction for Low Power Design
We propose a method for power optimization that considers glitch reduction by gate sizing based on the statistical estimation of glitch transitions. Our method reduces not only th...
Masanori Hashimoto, Hidetoshi Onodera, Keikichi Ta...