483 search results - page 20 / 97 » Linear Ranking with Reachability |
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper addresses the problem of characterizing
a general class of cameras under reasonable, “linear”
assumptions. Concretely, we use the formalism and
terminology of cla...
COR
2008
13 years 8 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
ACTA
2007
13 years 8 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
ENTCS
2006
13 years 8 months ago
2006
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...