Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph...
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
In confocal microscopy imaging, target objects are labeled with fluorescent markers in the living specimen, and usually appear as spots in the observed images. Spot detection and ...
Kangyu Pan, Anil C. Kokaram, Jens Hillebrand, Mani...
Expressions are found for the throughput and delay performance of a Tree Conflict Resolution Algorithm that is used in a Local Area Network with carrier sensing (and possibly also ...