Sciweavers

2527 search results - page 242 / 506
» Discrete optimization in computer vision
Sort
View
PPSN
2010
Springer
15 years 4 months ago
An Analysis of the XOR Dynamic Problem Generator Based on the Dynamical System
In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...
Renato Tinós, Shengxiang Yang
ICDT
2011
ACM
232views Database» more  ICDT 2011»
14 years 9 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
PODC
2005
ACM
15 years 11 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
ICCV
2011
IEEE
14 years 6 months ago
From Learning Models of Natural Image Patches to Whole Image Restoration
Learning good image priors is of utmost importance for the study of vision, computer vision and image processing applications. Learning priors and optimizing over whole images can...
Daniel Zoran, Yair Weiss
IPPS
2000
IEEE
15 years 10 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke