7106 search results - page 439 / 1422 » Restricted Complexity, General Complexity |
212
click to vote
IPPS
2009
IEEE
16 years 2 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
221
click to vote
CIVR
2009
Springer
16 years 2 months ago
2009
Springer
The GIST descriptor has recently received increasing attention in the context of scene recognition. In this paper we evaluate the search accuracy and complexity of the global GIST...
223
click to vote
CPAIOR
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
236
click to vote
CSR
2009
Springer
16 years 2 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
191
Voted
FCT
2009
Springer
16 years 2 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...