We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...