4118 search results - page 169 / 824 » Efficient Algorithms for Airline Problem |
149
Voted
JMLR
2010
14 years 10 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
160
Voted
ICIP
1999
IEEE
16 years 5 months ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
135
Voted
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
139
Voted
PPL
2010
14 years 10 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
147
Voted
ECCV
2006
Springer
15 years 7 months ago
2006
Springer
We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (lowresolution) im...