Sciweavers

1403 search results - page 22 / 281
» Set cover algorithms for very large datasets
Sort
View
IJCAI
1997
13 years 9 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 1 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 8 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
SMI
2008
IEEE
154views Image Analysis» more  SMI 2008»
14 years 2 months ago
SHREC'08 entry: Training set expansion via autotags
Training a 3D model classifier on a small dataset is very challenging. However, large datasets of partially classified models are now commonly available online. We use an external...
Corey Goldfeder, Haoyun Feng, Peter K. Allen
VL
1996
IEEE
157views Visual Languages» more  VL 1996»
14 years 18 days ago
Visualizing Program Executions on Large Data Sets
Understanding and interpreting a large data source is an important but challenging operation in many technical disciplines. Computer visualization has become a valuable tool to he...
John T. Stasko, Jeyakumar Muthukumarasamy