6102 search results - page 142 / 1221 » Generating Optimizing Specializers |
NIPS
2001
13 years 10 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
COR
2007
13 years 9 months ago
2007
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
DISOPT
2007
13 years 9 months ago
2007
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
ICIP
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
n a node with a b child, and abstract away some details of the AXML notation [3]. A. ActiveXML documents ActiveXML documents are XML documents including some special elements label...