199 search results - page 7 / 40 » A Method for Selecting the Bin Size of a Time Histogram |
BMCBI
2010
13 years 5 months ago
2010
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
BMCBI
2002
13 years 7 months ago
2002
Background: The biomedical community is developing new methods of data analysis to more efficiently process the massive data sets produced by microarray experiments. Systematic an...
ICIAP
2007
ACM
14 years 7 months ago
2007
ACM
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We propose an efficient method, built on the popular Bag
of Features approach, that obtains robust multiclass pixellevel
object segmentation of an image in less than 500ms,
with...