Sciweavers

12459 search results - page 95 / 2492
» cans 2006
Sort
View
JCT
2006
60views more  JCT 2006»
13 years 9 months ago
On the number of rectangulations of a planar point set
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...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
JDFP
2006
98views more  JDFP 2006»
13 years 9 months ago
Badvertisements: Stealthy Click-Fraud with Unwitting Accessories
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....
Mona Gandhi, Markus Jakobsson, Jacob Ratkiewicz
JGT
2006
40views more  JGT 2006»
13 years 9 months ago
How many graphs are unions of k-cliques?
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(...
Béla Bollobás, Graham Brightwell
JIIS
2006
83views more  JIIS 2006»
13 years 9 months ago
Querying a summary of database
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...
JMIV
2006
112views more  JMIV 2006»
13 years 9 months ago
Improving Deriche-style Recursive Gaussian Filters
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...
Gunnar Farnebäck, Carl-Fredrik Westin