Sciweavers

1026 search results - page 148 / 206
» On Finding Minimal w-cutset
Sort
View
CORR
2010
Springer
61views Education» more  CORR 2010»
13 years 9 months ago
An Improved DC Recovery Method from AC Coefficients of DCT-Transformed Images
Motivated by the work of Uehara et al. [1], an improved method to recover DC coefficients from AC coefficients of DCT-transformed images is investigated in this work, which finds ...
Shujun Li, Junaid Jameel Ahmad, Dietmar Saupe, C.-...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 9 months ago
Support Vector Machine Classification with Indefinite Kernels
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our...
Ronny Luss, Alexandre d'Aspremont
CSDA
2010
208views more  CSDA 2010»
13 years 9 months ago
Bayesian density estimation and model selection using nonparametric hierarchical mixtures
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
Raffaele Argiento, Alessandra Guglielmi, Antonio P...
ENDM
2010
141views more  ENDM 2010»
13 years 9 months ago
Solving Replica Placement and Request Distribution in Content Distribution Networks
A Content Distribution Network (CDN) is an overlay network where servers replicate contents and distribute client's requests with the aim at reducing delay, server load and n...
Tiago Araújo Neves, Lúcia Maria de A...
ECCC
2008
65views more  ECCC 2008»
13 years 9 months ago
A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
Chris Calabro