|
|
|
|
|
Mikita Akulich, Iztok Savnik, Matja? Krnc and Riste ?krekovski
This paper proposes a new data structure, multiset-trie, that is designed for storing and efficiently processing a set of multisets. Moreover, multiset-trie can operate on a set of sets without efficiency loss. The multiset-trie structure is a search tre...
ver más
|
|
|
|
|
|
|
|
|
|
|
Liliya A. Demidova and Julia S. Sokolova
The problem of the analysis of datasets formed by the results of group expert assessment of objects by a certain set of features is considered. Such datasets may contain mismatched, including conflicting values of object evaluations by the analyzed featu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Laurent Bulteau, Guillaume Fertin, Géraldine Jean and Christian Komusiewicz
A multi-cut rearrangement of a string S is a string ??'
S
'
obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string ??1·??2·??3·?·????·????+1
X
1
·
X...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jérémy Barbay
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within ??(??(1+lg??))???(??lg??)
O
(
n
(
1
+
lg
a
)
)
?
O
(
n
lg
n
)
, where the alternation ???[1..??-1]
a
?
[
1
.
.
n
-
1
]
approximates the minimal...
ver más
|
|
|
|
|
|
|
|
|
|
|
V. A. Andryuschenko,V. M. Ilman,V. I. Shinkarenko
Pág. 161 - 166
In the article the model scheme of sets of multigraph objects, where the tops are elements of hybrid multisets with unique weight loads, is offered.
|
|
|
|
|
|