2168 search results - page 280 / 434 » Randomized Algorithms and Complexity Theory |
120
Voted
ISCAS
1994
IEEE
15 years 7 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
115
Voted
FLAIRS
2006
15 years 4 months ago
2006
Diagnosing multiple faults for a complex system is often very difficult. It requires not only a model which adequately represents the diagnostic aspect of a complex system, but al...
140
Voted
TIP
2008
15 years 3 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
101
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
118
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...