2434 search results - page 95 / 487 » Algorithmic Randomness of Closed Sets |
144
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
142
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
149
Voted
CCCG
2009
15 years 4 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
148
Voted
IEICET
2010
15 years 22 days ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
132
Voted
3DPVT
2006
IEEE
15 years 9 months ago
2006
IEEE
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...