1139 search results - page 124 / 228 » Bounded Ideation Theory |
MP
2006
13 years 7 months ago
2006
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
SIAMCOMP
2008
13 years 7 months ago
2008
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
TIT
2008
13 years 7 months ago
2008
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
TOMACS
2002
13 years 7 months ago
2002
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...