We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
We describe a new type of threat to the Internet infrastructure, in the shape of a highly efficient but very well camouflaged click-fraud attack on the advertising infrastructure....
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for enduserstoeffi...
W. Amenel Voglozin, Guillaume Raschia, Laurent Ugh...
Gaussian smoothing filters and Gaussian derivative filters can be estimated by recursive IIR filters, as shown by Deriche [3, 4]. The design of those filters does, however, not enf...