10988 search results - page 205 / 2198 » Algorithmic Folding Complexity |
132
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
124
Voted
UAI
2008
15 years 5 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
128
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Lambert's model is widely used in low level computer vision algorithms such as matching, tracking or optical flow computation for example. However, it is well known that thes...
135
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
122
Voted
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...