Sciweavers

1968 search results - page 218 / 394
» The Complexity of Valued Constraint Models
Sort
View
105
Voted
ICASSP
2011
IEEE
14 years 5 months ago
Prediction of discrete cosine transformed coefficients in resized pixel blocks
Abstract— A hybrid model was developed to predict the zeroquantized discrete cosine transform (ZQDCT) coefficients for intra blocks in our previous work. However, the complicated...
Jin Li, Weiwei Chen, Moncef Gabbouj, Jarmo Takala,...
126
Voted
TSP
2008
101views more  TSP 2008»
15 years 1 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
ICASSP
2011
IEEE
14 years 5 months ago
BEP walls for collaborative spectrum sensing
—The main focus of this paper is to present a performance limitation of collaborative spectrum sensing in cognitive radios with imperfect reporting channels. We consider hard dec...
Sachin Chaudhari, Jarmo Lundén, Visa Koivun...
118
Voted
CMSB
2009
Springer
15 years 8 months ago
Probabilistic Approximations of Signaling Pathway Dynamics
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
Bing Liu, P. S. Thiagarajan, David Hsu
CEC
2008
IEEE
15 years 8 months ago
Potential and dynamics-based Particle Swarm Optimization
Abstract— The Particle Swarm Optimization (PSO) algorithm is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper p...
Hyungmin Park, Jong-Hwan Kim