Sciweavers

1257 search results - page 204 / 252
» A generalization of Euler's constant
Sort
View
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 7 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
ECCC
2011
202views ECommerce» more  ECCC 2011»
13 years 2 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
MST
2010
187views more  MST 2010»
13 years 2 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
SPEECH
2010
80views more  SPEECH 2010»
13 years 2 months ago
The Nijmegen Corpus of Casual French
This article describes the preparation, recording and orthographic transcription of a new speech corpus, the Nijmegen Corpus of Casual French (NCCFr). The corpus contains a total ...
Francisco Torreira, Martine Adda-Decker, Mirjam Er...
PODS
2011
ACM
220views Database» more  PODS 2011»
12 years 10 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams