436 search results - page 38 / 88 » Recursion and Complexity |
COMPLIFE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Most methods for multiple object tracking in video represent the state of multi-objects in a high dimensional joint state space. This leads to high computational complexity. This ...
ENTCS
2007
13 years 7 months ago
2007
The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations usi...