2254 search results - page 33 / 451 » Computing the minimal covering set |
MP
1998
13 years 9 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
FSKD
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
Nonlinear registration is mostly performed after initialization by a global, linear transformation (in this work, we focus on similarity transformations), computed by a linear reg...
ICCS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...