Sciweavers

147 search results - page 16 / 30
» The Computational Complexity of Quantified Reciprocals
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
A no-reference perceptual blockiness metric
A novel no-reference blockiness metric that can automatically and perceptually quantify blocking artifacts of DCT coding is presented. The proposed metric is built upon the specif...
Hantao Liu, Ingrid Heynderickx
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
15 years 3 months ago
Shape Measure for Identifying Perceptually Informative Parts of 3D Objects
We propose a mathematical approach for quantifying shape complexity of 3D surfaces based on perceptual principles of visual saliency. Our curvature variation measure (CVM), as a 3...
Sreenivas R. Sukumar, David Page, Andrei V. Gribok...
COMPUTER
2002
129views more  COMPUTER 2002»
14 years 9 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
ICASSP
2011
IEEE
14 years 1 months ago
Online anomaly detection with expert system feedback in social networks
In this paper, we propose examining the participants in various meetings or communications within a social network, and using sequential inference based on these participant lists...
Corinne Horn, Rebecca Willett
ACG
2009
Springer
15 years 4 months ago
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in mo...
Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta