Sciweavers

17541 search results - page 3181 / 3509
» Complexity in scalable computing
Sort
View
ICIP
2010
IEEE
15 years 4 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
ICIP
2010
IEEE
15 years 3 months ago
Saliency detection using maximum symmetric surround
Detection of visually salient image regions is useful for applications like object segmentation, adaptive compression, and object recognition. Recently, full-resolution salient ma...
Radhakrishna Achanta, Sabine Süsstrunk
AI
2011
Springer
15 years 1 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 1 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
Philip Schniter
« Prev « First page 3181 / 3509 Last » Next »