Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Jukka Teuhola"'
Autor:
Jukka Teuhola, Arto Niemi
Publikováno v:
Software: Practice and Experience. 50:1858-1874
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af52e180cc70aeba38b59c1fea4309ea
https://doi.org/10.1002/spe.2873
https://doi.org/10.1002/spe.2873
Autor:
Esa Tyystjärvi, Heta Mattila, Olli S. Nevalainen, Jukka Teuhola, Henri Tenhunen, Tapio Pahikkala
Publikováno v:
Computers and Electronics in Agriculture. 162:677-688
Automatic locating of weeds from fields is an active research topic in precision agriculture. A reliable and practical plant identification technique would enable the reduction of herbicide amounts and lowering of production costs, along with reducin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bda7f77cdc021eae3353a153579d5d9
https://doi.org/10.1016/j.compag.2019.05.002
https://doi.org/10.1016/j.compag.2019.05.002
Autor:
Heta Mattila, Tapio Pahikkala, Olli S. Nevalainen, Pertti Valli, Esa Tyystjärvi, Jukka Teuhola
Publikováno v:
Precision Agriculture. 14:621-636
With automatic plant identification methods, the amount of herbicides used in agriculture can be reduced when herbicides are sprayed only on weeds. In the present study, leaves of oat (Avena sativa) and dandelion (Taraxacum officinale, TAROF) were ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00ee6c09746695b16ae1239cbda890da
https://doi.org/10.1007/s11119-013-9320-y
https://doi.org/10.1007/s11119-013-9320-y
Autor:
Jukka Teuhola
Publikováno v:
IEEE Transactions on Information Theory. 57:6170-6179
A simple and efficient nonblock coding scheme for binary sources is suggested. It uses a probability model to map any source string to a unique integer, and thereby defines an enumeration of all possible strings. Contrary to normal enumerative coding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d5baba33c9b14745c0317c6a09cc024
https://doi.org/10.1109/tit.2011.2161910
https://doi.org/10.1109/tit.2011.2161910
Autor:
Jukka Teuhola
Publikováno v:
Information Processing & Management. 47(5):742-761
Sequences of integers are common data types, occurring either as primary data or ancillary structures. The sizes of sequences can be large, making compression an interesting option. Effective compression presupposes variable-length coding, which dest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cef42d7d1d9b60b994af338db3e86e3
http://juuli.fi/Record/0050465711
http://juuli.fi/Record/0050465711
Autor:
Jukka Teuhola
Publikováno v:
The Computer Journal. 52:368-377
A new, simple non-statistical source coding technique for sequences of integers is suggested. The method is based on a tournament scheme, with the sequence arranged into pairs, where maxima (‘winners’) are encoded recursively, and minima are enco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c44336de5b75babb6ab3be6084d1cae
https://doi.org/10.1093/comjnl/bxn030
https://doi.org/10.1093/comjnl/bxn030
Autor:
Attila Gyenesei, Jukka Teuhola
Publikováno v:
International Journal of Intelligent Systems. 19:1111-1126
The article suggests a partitioning algorithm for quantitative attributes to support the discovery of frequent fuzzy patterns among transactions containing such attributes. More precisely, we present a heuristic, multivariate, top-down partitioning a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3b12841fe4e882892dec7d522bf8ecb
https://doi.org/10.1002/int.20039
https://doi.org/10.1002/int.20039
Autor:
Jukka Teuhola
Publikováno v:
Data & Knowledge Engineering. 15:169-183
A new object identification scheme for object-oriented databases is suggested. Its purpose is to choose object surrogates so that they convey information about preferred clustering of stored objects. The surrogates are composed of two fields: cluster
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61ae6e97cd0cfbd42a6b70d0e693e5de
https://doi.org/10.1016/0169-023x(95)00004-c
https://doi.org/10.1016/0169-023x(95)00004-c
Publikováno v:
String Processing and Information Retrieval ISBN: 9783642341083
SPIRE
SPIRE
In this paper we deal with compressed integer arrays that are equipped with fast random access. Our treatment improves over an earlier approach that used address-calculation coding to locate the elements and supported access and search operations in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a9b0b33c06b61bced286dbfc739d7e5
https://doi.org/10.1007/978-3-642-34109-0_22
https://doi.org/10.1007/978-3-642-34109-0_22
