3946 search results - page 789 / 790 » The computational complexity of choice sets |
BMCBI
2008
13 years 5 months ago
2008
Background: Microarray experimentation requires the application of complex analysis methods as well as the use of non-trivial computer technologies to manage the resultant large d...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
COMPGEOM
2010
ACM
13 years 10 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 ...
STOC
2009
ACM
14 years 5 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 ...