12257 search results - page 320 / 2452 » Analysis of Algorithms |
156
click to vote
ACCV
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Compared with the color histogram, where the position information of each pixel is ignored, a simplified color correlogram (SCC) representation encodes the spatial inform...
154
click to vote
COCO
1995
Springer
15 years 7 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
136
click to vote
DAC
2009
ACM
15 years 7 months ago
2009
ACM
In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dim...
141
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
142
click to vote
MOC
2002
15 years 3 months ago
2002
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...