526 search results - page 26 / 106 » Increments of Random Partitions |
105
click to vote
DAM
2006
14 years 11 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...
126
click to vote
ICIP
2004
IEEE
16 years 1 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
15 years 1 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...
112
click to vote
FSE
1997
Springer
15 years 3 months 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
15 years 3 months 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...