Sciweavers

816 search results - page 73 / 164
» Abstract Barycentric Algebras
Sort
View
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 3 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
CLUSTER
2007
IEEE
14 years 3 months ago
Satisfying your dependencies with SuperMatrix
— SuperMatrix out-of-order scheduling leverages el abstractions and straightforward data dependency analysis to provide a general-purpose mechanism for obtaining parallelism from...
Ernie Chan, Field G. Van Zee, Enrique S. Quintana-...
ASPDAC
2005
ACM
125views Hardware» more  ASPDAC 2005»
14 years 2 months ago
A formalism for functionality preserving system level transformations
— With the rise in complexity of modern systems, designers are spending a significant time on at the system level of abstraction. This paper introduces Model Algebra, a formalis...
Samar Abdi, Daniel Gajski
SEMWEB
2009
Springer
14 years 1 months ago
Reasoning With Provenance, Trust and all that other Meta Knowlege in OWL
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
Simon Schenk, Renata Queiroz Dividino, Steffen Sta...
SAIG
2001
Springer
14 years 1 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann