Sciweavers

2414 search results - page 366 / 483
» Computing Normal Subgroups
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
ISBI
2002
IEEE
15 years 10 months ago
Quantitative 3D CT bronchography
In the framework of computer-aided diagnosis, this paper proposes a novel functionality for computerized tomography (CT)based investigation of pulmonary airways. It provides a spe...
Catalin I. Fetita, Françoise J. Prête...
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
15 years 10 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
15 years 10 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
VLDB
2005
ACM
132views Database» more  VLDB 2005»
15 years 10 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson