4539 search results - page 290 / 908 » Approaches to Compute Workflow Complexity |
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
211
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
155
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
167
click to vote
SOFSEM
2007
Springer
16 years 22 days ago
2007
Springer
The requirements for a system are often specified as textual use cases. Although they are written in natural language, the simple and uniform sentence structure used makes automate...
203
click to vote
CVPR
2006
IEEE
16 years 20 days ago
2006
IEEE
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to ...