|
|
|
Martin Kenyeres and Jozef Kenyeres
Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology. Nevertheless, one can see a lack of scientific studies dealing wi...
ver más
|
|
|
|
|
|
|
Raffaele Marino and Scott Kirkpatrick
|
|
|
|
|
|
|
Nicola Prezza
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time proportio...
ver más
|
|
|
|
|
|
|
Dean Crnkovic, Andrea ?vob and Vladimir D. Tonchev
A generalization of Ding?s construction is proposed that employs as a defining set the collection of the sth powers (??=2
s
=
2
) of all nonzero elements in ????(????)
G
F
(
p
m
)
, where ??=2
p
=
2
is prime. Some of the resulting codes are optimal or n...
ver más
|
|
|
|
|
|
|
Maxime Augier; Shalom Eliahou
Pág. 1831 - 1839
|
|
|
|
|
|
|
H. S. Zhelezniak,K. I. Soldatov,R. S. Zhelezniak
Pág. 183 - 189
In work on the example of three-flight irregular beam on resilient supports influence of the once-personal on inflexibility resilient supports is probed on a regular beam, and influence of different stiffness of resilient supports (identical between itse...
ver más
|
|
|
|
|
|
|
Xiao-Yu Hu; Eleftheriou, E.; Arnold, D.M.
Pág. 386 - 398
|
|
|
|
|
|
|
Salil P. Vadhan
Pág. 398 - 427
|
|
|
|