597 search results - page 20 / 120 » Dominating Distributions and Learnability |
152
click to vote
TNN
1998
15 years 4 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
129
Voted
ICTIR
2009
Springer
15 years 11 months ago
2009
Springer
Empirical modeling of the score distributions associated with retrieved documents is an essential task for many retrieval applications. In this work, we propose modeling the releva...
150
click to vote
PPL
2008
15 years 5 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
157
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
160
click to vote
ICDCS
2008
IEEE
15 years 11 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...