Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
Roger Luis, Luis Enrique Sucar, Eduardo F. Morales
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...