Sciweavers

1992 search results - page 377 / 399
» Memory modeling for system synthesis
Sort
View
TIT
2008
102views more  TIT 2008»
14 years 9 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
CJ
2010
87views more  CJ 2010»
14 years 8 months ago
Resource-Aware Multimedia Content Delivery: A Gambling Approach
In this paper, we propose a resource-aware solution to achieving reliable and scalable stream diffusion in a probabilistic model, i.e., where communication links and processes are...
Mouna Allani, Benoît Garbinato, Fernando Ped...
TCSV
2011
14 years 4 months ago
Mixture of Gaussians-Based Background Subtraction for Bayer-Pattern Image Sequences
This paper proposes a background subtraction method for Bayer-pattern image sequences. The proposed method models the background in a Bayer-pattern domain using a mixture of Gauss...
Jae Kyu Suhr, Ho Gi Jung, Gen Li, Jaihie Kim
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
14 years 1 months ago
SQPR: Stream query planning with reuse
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hi...
AI
2011
Springer
14 years 1 months ago
Parallelizing a Convergent Approximate Inference Method
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
Ming Su, Elizabeth Thompson