89222 search results - page 13 / 17845 » Which |
FLAIRS
2006
13 years 10 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
APAL
2008
13 years 9 months ago
2008
In this short note we provide an example of a semi-linear group G which does not admit a semi-linear affine embedding; in other words, there is no semi-linear isomorphism between t...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
As a recently proposed technique, sparse representation based classification (SRC) has been widely used for face recognition (FR). SRC first codes a testing sample as a sparse lin...
EEMMAS
2007
Springer
14 years 3 months ago
2007
Springer
Complexity of near future and even nowadays applications is exponentially increasing. In order to tackle the design of such complex systems, being able to engineer self-organising ...
CCO
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...