Sciweavers

13603 search results - page 101 / 2721
» On the Complexity of Computing Treelength
Sort
View
RTA
2010
Springer
14 years 1 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 9 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
COMPLEX
2009
Springer
14 years 3 months ago
Characterizing the Structural Complexity of Real-World Complex Networks
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
Jun Wang, Gregory M. Provan
NSDI
2008
13 years 11 months ago
NetComplex: A Complexity Metric for Networked System Designs
The systems and networking community treasures "simple" system designs, but our evaluation of system simplicity often relies more on intuition and qualitative discussion...
Byung-Gon Chun, Sylvia Ratnasamy, Eddie Kohler
TROB
2002
120views more  TROB 2002»
13 years 8 months ago
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
N. R. Srinivasa Raghavan, Tanmay Waghmare