5100 search results - page 910 / 1020 » The Linear Complexity of a Graph |
156
click to vote
CC
2010
Springer
15 years 2 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
121
click to vote
ACCV
2010
Springer
14 years 12 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
137
Voted
CDC
2010
IEEE
14 years 12 months ago
2010
IEEE
This paper studies stabilization of polytopic delay difference inclusions via the Razumikhin approach. An example of a linear delay difference equation that is globally exponential...
185
click to vote
CORR
2011
Springer
14 years 12 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
148
Voted
CORR
2011
Springer
14 years 12 months ago
2011
Springer
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...