Sciweavers

5802 search results - page 208 / 1161
» Parallelizing Feature Selection
Sort
View
ICS
2010
Tsinghua U.
15 years 7 months ago
Robust Perfect Revenue From Perfectly Informed Players
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
Jing Chen, Avinatan Hassidim, Silvio Micali
DAGM
2008
Springer
15 years 4 months ago
Learning Visual Compound Models from Parallel Image-Text Datasets
Abstract. In this paper, we propose a new approach to learn structured visual compound models from shape-based feature descriptions. We use captioned text in order to drive the pro...
Jan Moringen, Sven Wachsmuth, Sven J. Dickinson, S...
NPC
2007
Springer
15 years 9 months ago
A Cost-Aware Parallel Workload Allocation Approach Based on Machine Learning Techniques
Parallelism is one of the main sources for performance improvement in modern computing environment, but the efficient exploitation of the available parallelism depends on a number ...
Shun Long, Grigori Fursin, Björn Franke
PPL
2008
99views more  PPL 2008»
15 years 3 months ago
A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
Frédéric Gava
CEE
2010
67views more  CEE 2010»
15 years 3 months ago
Series feature aggregation for content-based image retrieval
Feature aggregation is a critical technique in content-based image retrieval systems that employ multiple visual features to characterize image content. One problem in feature aggr...
Jun Zhang, Lei Ye