3244 search results - page 33 / 649 » On convex complexity measures |
159
click to vote
SAS
2005
Springer
15 years 11 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
142
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
147
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
163
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
We present a novel approach for automatically discovering spatio-temporal patterns in complex dynamic scenes. Similarly to recent non-object centric methods, we use low level visu...
159
click to vote
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Convexity is an important geometric property of many natural and man-made structures. Prior research has shown that it is imperative to many perceptual-organization and imageunder...