Sciweavers

2527 search results - page 240 / 506
» Discrete optimization in computer vision
Sort
View
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 11 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 11 days ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
166
Voted
COMPGEOM
1993
ACM
15 years 10 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
CSIE
2009
IEEE
16 years 29 days ago
An Improved Algorithm of Digital Watermarking Based on Wavelet Transform
In this paper, a digital image watermarking technique based on Discrete Wavelet Transform (DWT) will be proposed. This scheme is designed utilizing principles deriving from the hu...
Jianhong Sun, Junsheng Li, Zhiyong Li
SIBGRAPI
2008
IEEE
16 years 18 days ago
Approximations by Smooth Transitions in Binary Space Partitions
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
Marcos Lage, Alex Laier Bordignon, Fabiano Petrone...