Sciweavers

2080 search results - page 82 / 416
» Measuring empirical computational complexity
Sort
View
JMM2
2007
59views more  JMM2 2007»
13 years 10 months ago
Single-Ended Quality Measurement of Noise Suppressed Speech Based on Kullback-Leibler Distances
— In this paper, a single-ended quality measurement algorithm for noise suppressed speech is described. The proposed algorithm computes fast approximations of KullbackLeibler dis...
Tiago H. Falk, Hua Yuan, Wai-Yip Chan
ISI
2010
Springer
13 years 8 months ago
Measuring behavioral trust in social networks
Abstract—Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important ro...
Sibel Adali, Robert Escriva, Mark K. Goldberg, Myk...
CIKM
2009
Springer
14 years 4 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
ICIP
1997
IEEE
14 years 11 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin
ICALP
2007
Springer
14 years 4 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret