Sciweavers

4131 search results - page 292 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
143
Voted
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 4 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
HEURISTICS
2000
127views more  HEURISTICS 2000»
15 years 4 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
CVPR
2009
IEEE
16 years 12 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
ICIP
2005
IEEE
16 years 6 months ago
Finding the global minimum for binary image restoration
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
Tony F. Chan, Selim Esedoglu, Mila Nikolova
ICIP
2009
IEEE
16 years 5 months ago
Super-resolution With Continuous Scan Shift
Super-resolution methods aimed to restore the spectrum of an original image above the half sampling frequency. The restoration problem is generally viewed as an inverse problem an...