Sciweavers

3875 search results - page 415 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
218
Voted
IJON
2006
131views more  IJON 2006»
15 years 6 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
CVPR
2004
IEEE
16 years 8 months ago
The SPS Algorithm: Patching Figural Continuity and Transparency by Split-Patch Search
This paper describes a novel algorithm for the efficient synthesis of high-quality virtual views from only two input images. The emphasis is on the recovery of continuity of objec...
Antonio Criminisi, Andrew Blake
CEC
2010
IEEE
15 years 7 months ago
Automatic construction of image transformation algorithms using feature based genetic image network
Image processing and recognition technologies are becoming increasingly important. Automatic construction methods for image transformation algorithms proposed to date approximate a...
Yuta Nakano, Shinichi Shirakawa, Noriko Yata, Tomo...
CORR
2006
Springer
74views Education» more  CORR 2006»
15 years 6 months ago
Scheduling Algorithms for Procrastinators
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
Michael A. Bender, Raphaël Clifford, Kostas T...
ICALP
2005
Springer
16 years 9 days ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...