- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-0565
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Continuation methods for approximate large scale object sequencing ; volume:108 ; number:4 ; day:23 ; month:10 ; year:2018 ; pages:595-626 ; date:4.2019
Machine learning ; 108, Heft 4 (23.10.2018), 595-626, 4.2019
- Creator
-
Evangelopoulos, Xenophon
Brockmeier, Austin J.
Mu, Tingting
Goulermas, John Y.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10994-018-5764-7
- URN
-
urn:nbn:de:101:1-2019032603314680588778
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:59 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Evangelopoulos, Xenophon
- Brockmeier, Austin J.
- Mu, Tingting
- Goulermas, John Y.
- SpringerLink (Online service)
Other Objects (12)
Approximate string matching for high-throughput sequencing
Approximate Competitive Equilibria in Large Economies
Fast approximate models of large networks
Approximate inference algorithms in large networked systems
Essays on the large dimensional approximate dynamic factor model
On the nonemptiness of approximate cores of large games
Modeling Large Time Series for Efficient Approximate Query Processing
On the nonemptiness of approximate cores of large games
Approximate registration of point clouds with large scale differences
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Computing approximate monogenic model likelihoods in large pedigrees with loops
Approximate stochastic behavior of n-server service systems with large n
Approximate string matching for high-throughput sequencing
Approximate Competitive Equilibria in Large Economies
Fast approximate models of large networks
Approximate inference algorithms in large networked systems
Essays on the large dimensional approximate dynamic factor model
On the nonemptiness of approximate cores of large games
Modeling Large Time Series for Efficient Approximate Query Processing
On the nonemptiness of approximate cores of large games
Approximate registration of point clouds with large scale differences
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Computing approximate monogenic model likelihoods in large pedigrees with loops
Approximate stochastic behavior of n-server service systems with large n
Approximate string matching for high-throughput sequencing
Approximate Competitive Equilibria in Large Economies
Fast approximate models of large networks
Approximate inference algorithms in large networked systems
Essays on the large dimensional approximate dynamic factor model
On the nonemptiness of approximate cores of large games
Modeling Large Time Series for Efficient Approximate Query Processing
On the nonemptiness of approximate cores of large games
Approximate registration of point clouds with large scale differences
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Computing approximate monogenic model likelihoods in large pedigrees with loops