Sciweavers

3220 search results - page 73 / 644
» Constrained Graph Processes
Sort
View
TWC
2010
13 years 4 months ago
Adaptive linearly constrained minimum variance beamforming for multiuser cooperative relaying using the kalman filter
In this paper, we consider a wireless communication scenario with multiple source-destination pairs communicating through several cooperative amplify-and-forward relay terminals. T...
Amr El-Keyi, Benoît Champagne
CISS
2010
IEEE
13 years 1 months ago
Cost constrained spectrum sensing in cognitive radio networks
—This paper addresses optimal spectrum sensing in cognitive radio networks considering its system level cost that accounts for the local processing cost of sensing (sample collec...
Gang Xiong, Shalinee Kishore, Aylin Yener
GPCE
2004
Springer
14 years 3 months ago
Compiling Process Graphs into Executable Code
Abstract. Model-driven architecture envisions a paradigm shift as dramatic as the one from low-level assembler languages to high-level programming languages. In order for this visi...
Rainer Hauser, Jana Koehler
ICIP
2008
IEEE
14 years 11 months ago
Variational Bayesian image processing on stochastic factor graphs
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
Xin Li
CSMR
2006
IEEE
14 years 4 months ago
Dynamic Object Process Graphs
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
Jochen Quante, Rainer Koschke