1984 search results - page 14 / 397 » The colourful feasibility problem |
CVPR
2001
IEEE
14 years 12 months ago
2001
IEEE
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...
AAAI
2011
12 years 9 months ago
2011
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
JCT
2006
13 years 9 months ago
2006
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
CPAIOR
2007
Springer
14 years 4 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
IV
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper introduces a novel technique for the visualization of data at various levels of detail. This is based on a colour-based representation of the data, where “high levelâ...