10988 search results - page 2099 / 2198 » Algorithmic Folding Complexity |
116
click to vote
ICIAR
2009
Springer
15 years 9 months ago
2009
Springer
This paper considers the problem of altering an image by imperceptibly adding or removing pixels, for example, to fit a differently shaped frame with minimal loss of interesting ...
118
Voted
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
149
click to vote
NOSSDAV
2009
Springer
15 years 9 months ago
2009
Springer
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
157
Voted
QOSA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Component interfaces, as advanced by the Common Component Architecture (CCA), enable easy access to complex software packages for high-performance scientific computing. ...
125
click to vote
ASPDAC
2009
ACM
15 years 9 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...