ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
ICGI
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
ACSAC
2001
IEEE
13 years 8 months ago
2001
IEEE
The state of the science of information security is astonishingly rich with solutions and tools to incrementally and selectively solve the hard problems. In contrast, the state of...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...