3244 search results - page 186 / 649 » On convex complexity measures |
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
106
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
101
click to vote
IPSN
2005
Springer
15 years 7 months ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
104
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
105
click to vote
GFKL
2007
Springer
15 years 8 months ago
2007
Springer
The analysis of genetic diseases has classically been directed towards establishing direct links between cause, a genetic variation, and effect, the observable deviation of phenot...