Sciweavers

811 search results - page 74 / 163
» Avoiding Approximate Squares
Sort
View
ICMCS
2005
IEEE
131views Multimedia» more  ICMCS 2005»
14 years 1 months ago
A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
Xiaoqing Zhu, Bernd Girod
VMV
2008
120views Visualization» more  VMV 2008»
13 years 9 months ago
Interpolating and Downsampling RGBA Volume Data
For about twenty years the standard color sampling method for RGBA volume data has been the interpolation of opacity-weighted colors. In this work, we discuss the underlying appro...
Martin Kraus, Kai Bürger
AAAI
2006
13 years 9 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
AICOM
2006
124views more  AICOM 2006»
13 years 7 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
JSAC
2008
70views more  JSAC 2008»
13 years 7 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping