13306 search results - page 330 / 2662 » Theoretical Computer Science |
154
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
138
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
We extract a quantitative variant of uniqueness from the usual hypotheses of the implicit functions theorem. This leads not only to an a priori proof of continuity, but also to an ...
171
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
169
click to vote
RELMICS
2009
Springer
16 years 1 months ago
2009
Springer
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...