Sciweavers

1403 search results - page 90 / 281
» Set cover algorithms for very large datasets
Sort
View
IEEEVAST
2010
14 years 11 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
CPHYSICS
2007
81views more  CPHYSICS 2007»
15 years 4 months ago
The ATLAS computing model: status, plans and future possibilities
The ATLAS Collaboration[1] has been preparing for Large Hadron Collider (LHC) running for more than 20 years. By summer of 2007 we expect the first colliding beams of protons and...
Shawn McKee
CVPR
2010
IEEE
15 years 8 months ago
On the design of robust classifiers for computer vision
The design of robust classifiers, which can contend with the noisy and outlier ridden datasets typical of computer vision, is studied. It is argued that such robustness requires l...
Hamed Masnadi-Shirazi, Nuno Vasconcelos, Vijay Mah...
CVPR
2008
IEEE
16 years 6 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 4 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount