Sciweavers

2312 search results - page 8 / 463
» The complexity of estimating min-entropy
Sort
View
NECO
2010
97views more  NECO 2010»
13 years 7 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
ML
2002
ACM
128views Machine Learning» more  ML 2002»
13 years 8 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
ICIP
2009
IEEE
13 years 6 months ago
A multi-modal automatic image registration technique based on complex wavelets
Image registration is considered one of the most fundamental and crucial pre-processing tasks in digital imaging. This paper describes a fast multimodal automatic image registrati...
Milad Ghantous, Soumik Ghosh, Magdy Bayoumi
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 6 months ago
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
Amit Chakrabarti, Oded Regev
APSEC
2006
IEEE
14 years 2 months ago
A Practical Estimation Method for Complex RE
Software projects typically require effort estimation from the Software Development Life Cycle (SDLC) staff at the commencement of the software development activities. Inaccuracie...
Bhavani Palyagar, Frank Moisiadis