Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jens Willkomm"'
Publikováno v:
Database Systems for Advanced Applications ISBN: 9783030731960
DASFAA (2)
DASFAA (2)
Estimating the cost of a query plan is one of the hardest problems in query optimization. This includes cardinality estimates of string search patterns, of multi-word strings like phrases or text snippets in particular. At first sight, suffix trees a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c514c48a5f6629f1794e8fac78aba5b4
https://doi.org/10.1007/978-3-030-73197-7_50
https://doi.org/10.1007/978-3-030-73197-7_50
Publikováno v:
SSTD
Similarity search on time series from large temporal text corpora is interesting in many settings. Our use case is the Google Books Ngram corpus and historians interested in the changes of word frequencies over time. More specifically, users are inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b88c2f804a6ecacb89357ed04939ead
https://doi.org/10.1145/3340964.3340969
https://doi.org/10.1145/3340964.3340969
Publikováno v:
JCDL
Researching the evolution of the concepts represented by words, like "peace" or "freedom", named conceptual history, is an important discipline in the humanities, but still a laborious task. It normally consists of reading and interpreting a large nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a5331c5324099f553312946026e9a27
https://doi.org/10.1145/3197026.3197044
https://doi.org/10.1145/3197026.3197044
Publikováno v:
ChinaSIP
For temporal data analytics it is essential to assess the similarity of time series numerically. For similarity measures, in turn, appropriate time series representation techniques are needed. We present and discuss two techniques for time series rep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e65e844c5e4fbb23a435cedad686a86
https://doi.org/10.1109/chinasip.2014.6889345
https://doi.org/10.1109/chinasip.2014.6889345
Publikováno v:
FPL
The scaling operation, i. e., the multiplication with a single constant is a frequently used operation in many kinds of numeric algorithms. The multiple constant multiplication (MCM) is a generalization where a variable is multiplied by several const
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4b39461464240d6f6f196487e9c54e6
https://doi.org/10.1109/fpl.2013.6645543
https://doi.org/10.1109/fpl.2013.6645543