3415 search results - page 197 / 683 » Lower bounds on kernelization |
143
click to vote
CGF
2005
15 years 6 months ago
2005
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive....
183
Voted
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
199
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
147
Voted
AINA
2007
IEEE
16 years 14 days ago
2007
IEEE
This paper describes results concerning the robustness and generalization capabilities of kernel methods in detecting coordinated distributed multiple attacks (CDMA) using network...
177
Voted
WCE
2007
15 years 7 months ago
2007
– In this paper we perform a t-test for significant gene expression analysis in different dimensions based on molecular profiles from microarray data, and compare several computa...