2629 search results - page 78 / 526 » complex 2009 |
ICALP
2009
Springer
15 years 2 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
ICDCN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
SIGPRO
2010
14 years 8 months ago
2010
This paper proposes a novel compression scheme with a tunable complexity-ratedistortion trade-off. As images increase in size and resolution, more efficient compression schemes w...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider rate allocation for multiple video users sharing a constant bitrate channel. Previously, overall quality of multiple users was improved by exploiting relative complexi...