Sciweavers

2126 search results - page 335 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 4 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
ICCV
2009
IEEE
16 years 9 months ago
Large Displacement Optical Flow Computation without Warping
We propose an algorithm for large displacement opti- cal flow estimation which does not require the commonly used coarse-to-fine warping strategy. It is based on a quadratic rel...
Frank Steinbrucker, Thomas Pock, Daniel Cremers
198
Voted
ICCV
1999
IEEE
16 years 5 months ago
Curve Finder Combining Perceptual Grouping and a Kalman Like Fitting
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
Frederic Guichard, Jean-Philippe Tarel
126
Voted
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
15 years 10 months ago
Some Basics on Tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
Boris Goldengorin, Gerold Jäger, Paul Molitor
128
Voted
GECCO
2004
Springer
15 years 10 months ago
Subthreshold-Seeking Behavior and Robust Local Search
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
L. Darrell Whitley, Keith Bush, Jonathan E. Rowe