Sciweavers

16626 search results - page 2958 / 3326
» Computing is a natural science
Sort
View
MST
2010
140views more  MST 2010»
15 years 5 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
PAMI
2010
192views more  PAMI 2010»
15 years 5 months ago
Esaliency (Extended Saliency): Meaningful Attention Using Stochastic Image Modeling
Computer-vision attention processes allocate computational resources to different parts of visual input and can lead to faster object recognition and image analysis. This paper p...
Tamar Avraham, Michael Lindenbaum
PAMI
2010
396views more  PAMI 2010»
15 years 5 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu
PCM
2010
Springer
193views Multimedia» more  PCM 2010»
15 years 5 months ago
Color Spectrum Normalization: Saliency Detection Based on Energy Re-allocation
Spectrum normalization is a process shared by two saliency detection methods, Spectral Residual (SR) and Phase Fourier Transform (PFT). In this paper, we point out that the essence...
Zhuoliang Kang, Junping Zhang
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 5 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
« Prev « First page 2958 / 3326 Last » Next »