2434 search results - page 25 / 487 » Algorithmic Randomness of Closed Sets |
115
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
125
click to vote
CGF
2006
15 years 1 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
108
click to vote
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
138
click to vote
ICIP
2005
IEEE
16 years 3 months ago
2005
IEEE
We investigate a method of segmentation of multichannel polarimetric images, such as in laser illuminated or synthetic aperture radar, into a given but arbitrary number of regions...
101
click to vote
JEA
1998
15 years 1 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...