Sciweavers

1403 search results - page 52 / 281
» Set cover algorithms for very large datasets
Sort
View
BMCBI
2011
14 years 11 months ago
Tiling array data analysis: a multiscale approach using wavelets
Background: Tiling array data is hard to interpret due to noise. The wavelet transformation is a widely used technique in signal processing for elucidating the true signal from no...
Alexander Karpikov, Joel S. Rozowsky, Mark Gerstei...
BMCBI
2006
158views more  BMCBI 2006»
15 years 4 months ago
Parallelization of multicategory support vector machines (PMC-SVM) for classifying microarray data
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
Chaoyang Zhang, Peng Li, Arun Rajendran, Youping D...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 4 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
CVPR
2011
IEEE
15 years 6 days ago
Distributed Computer Vision Algorithms Through Distributed Averaging
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
Roberto Tron, René, Vidal
CG
2004
Springer
15 years 3 months ago
Dynamic surfel set refinement for high-quality rendering
Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for la...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...