69 search results - page 7 / 14 » Covering and Packing in Linear Space |
NECO
2000
13 years 7 months ago
2000
We present a new method that we call Generalized Discriminant Analysis (GDA) to deal with nonlinear discriminant analysis using kernel function operator. The underlying theory is ...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Without any assumption on the cover source, this paper presents a complete characterization of all perfectly secure stego-systems that employ mutually independent embedding operat...
ICMCS
2010
IEEE
13 years 7 months ago
2010
IEEE
Speech processing is an important aspect of affective computing. Most research in this direction has focused on classifying emotions into a small number of categories. However, nu...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...