Sciweavers

1653 search results - page 84 / 331
» Directed tree-width examples
Sort
View
ISPAN
2002
IEEE
15 years 2 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
ICIP
2000
IEEE
15 years 2 months ago
Chromaticity Diffusion
—A novel approach for color image denoising is proposed in this paper. The algorithm is based on separating the color data into chromaticity and brightness, and then processing e...
Bei Tang, Guillermo Sapiro, Vicent Caselles
VISUALIZATION
2000
IEEE
15 years 2 months ago
Combining local and remote visualization techniques for interactive volume rendering in medical applications
For a comprehensive understanding of tomographic image data in medical routine, interactive and high–quality direct volume rendering is an essential prerequisite. This is provid...
Klaus Engel, Thomas Ertl, Peter Hastreiter, Bernd ...
PRICAI
1999
Springer
15 years 2 months ago
Rationality of Reward Sharing in Multi-agent Reinforcement Learning
Abstract. In multi-agent reinforcement learning systems, it is important to share a reward among all agents. We focus on the Rationality Theorem of Profit Sharing [5] and analyze ...
Kazuteru Miyazaki, Shigenobu Kobayashi
TAPSOFT
1997
Springer
15 years 1 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko