Sciweavers

1957 search results - page 147 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
IFIPTCS
2010
14 years 8 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 4 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
CVPR
2008
IEEE
15 years 12 months ago
Multi-label image segmentation via point-wise repetition
Bottom-up segmentation tends to rely on local features. Yet, many natural and man-made objects contain repeating elements. Such structural and more spread-out features are importa...
Gang Zeng, Luc J. Van Gool
ICCV
2005
IEEE
15 years 12 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon