265 search results - page 51 / 53 » How to Prove Inductive Theorems |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
ACSAC
2007
IEEE
14 years 2 months ago
2007
IEEE
Malicious code is an increasingly important problem that threatens the security of computer systems. The traditional line of defense against malware is composed of malware detecto...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...