Sciweavers

2200 search results - page 92 / 440
» Bloch's Constant is Computable
Sort
View
MFCS
2009
Springer
15 years 2 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
ICCV
2011
IEEE
13 years 10 months ago
Inferring Social Relations from Visual Concepts
In this paper, we study the problem of social relational inference using visual concepts which serve as indicators of actors’ social interactions. While social network analysis ...
Lei Ding, Alper Yilmaz
ACSAC
2007
IEEE
15 years 4 months ago
Limits of Static Analysis for Malware Detection
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...
Andreas Moser, Christopher Kruegel, Engin Kirda
89
Voted
ESANN
2004
14 years 11 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
14 years 9 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...