526 search results - page 26 / 106 » Increments of Random Partitions |
DAM
2006
13 years 8 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
ICIP
2004
IEEE
14 years 10 months ago
2004
IEEE
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...
EDBT
2006
ACM
13 years 10 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
FSE
1997
Springer
14 years 18 days ago
1997
Springer
Matsui's linear cryptanalysis for iterated block ciphers is generalized to an attack called. This attack exploits a weakness that can be described by an e ective partition-pa...
COMPGEOM
1993
ACM
14 years 16 days ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...