4781 search results - page 175 / 957 » Complexity at large |
NIPS
2004
13 years 11 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
WSC
2001
13 years 11 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
ICIP
2002
IEEE
14 years 12 months ago
2002
IEEE
Overcomplete transforms, like the Dual-Tree Complex Wavelet Transform, offer more flexible signal representations than criticallysampled transforms. Large numbers of transform coe...
CG
1998
Springer
14 years 2 months ago
1998
Springer
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...