3244 search results - page 50 / 649 » On convex complexity measures |
95
Voted
DATE
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
VVS
1998
IEEE
15 years 3 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
100
click to vote
CIE
2010
Springer
15 years 4 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
SODA
2010
ACM
14 years 9 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
104
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Accurate denition of similarity measure is a key component
in image registration. Most commonly used intensitybased
similarity measures rely on the assumptions of independence
...