337 search results - page 18 / 68 » Computational complexity of weighted splitting schemes on pa... |
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Recent research has revealed that circularity (or, propriety) of complex random signals can be exploited in developing optimal signal processors. In this paper, a robust estimator...
ECRTS
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider unicast-based pipelined broadcast schemes for clusters connected by multiple Ethernet switches. By splitting a large broadcast message into segments and broadcasting t...
ICDCN
2009
Springer
14 years 2 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...