6 citations · 8 across the 4 of their papers we have counts for
7 papers
Entropy estimation in bidimensional sequences
F. N. M. de Sousa Filho, V. G. Pereira de Sá, E. Brigatti
We investigate the performance of entropy estimation methods, based either on block entropies or compression approaches, in the case of bidimensional sequences. We introduce a vali…
Dijkstra Graphs
Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado +3
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquir…
Blind-friendly von Neumann's Heads or Tails
Vinícius Gusmão Pereira de Sá, Celina Miraglia Herrera de Figueiredo
The toss of a coin is usually regarded as the epitome of randomness, and has been used for ages as a means to resolve disputes in a simple, fair way. Perhaps as ancient as consulti…
Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
Guilherme D. da Fonseca, Vinícius G. Pereira de Sá, Celina M. H. de Figueiredo
Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios…
Towards a provably resilient scheme for graph-based watermarking
Lucila M. S. Bento, Davidson Boccardo, Raphael C. S. Machado +2
Digital watermarks have been considered a promising way to fight software piracy. Graph-based watermarking schemes encode authorship/ownership data as control-flow graph of dummy c…
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
Guilherme D. da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá +1
A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their application in wireless ad-hoc ne…