Sciweavers

1421 search results - page 138 / 285
» Satisfying KBO Constraints
Sort
View
CCGRID
2010
IEEE
15 years 8 months ago
Bandwidth Allocation for Iterative Data-Dependent E-science Applications
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework inco...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
ICASSP
2010
IEEE
15 years 7 months ago
Ergodic stochastic optimization algorithms for wireless communication and networking
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
Alejandro Ribeiro
JAR
2006
95views more  JAR 2006»
15 years 7 months ago
Mechanizing and Improving Dependency Pairs
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
Jürgen Giesl, René Thiemann, Peter Sch...
TSP
2008
105views more  TSP 2008»
15 years 7 months ago
Semi-Supervised Linear Spectral Unmixing Using a Hierarchical Bayesian Model for Hyperspectral Imagery
This paper proposes a hierarchical Bayesian model that can be used for semi-supervised hyperspectral image unmixing. The model assumes that the pixel reflectances result from linea...
Nicolas Dobigeon, Jean-Yves Tourneret, Chein-I Cha...
TON
2002
76views more  TON 2002»
15 years 6 months ago
Some properties of variable length packet shapers
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
Jean-Yves Le Boudec