Sciweavers

5802 search results - page 135 / 1161
» Parallelizing Feature Selection
Sort
View
WEBI
2001
Springer
15 years 7 months ago
A Fast Image-Gathering System on the World-Wide Web Using a PC Cluster
Abstract. Thanks to the recent explosive progress of WWW (WorldWide Web), we can easily access a large number of images from WWW. There are, however, no established methods to make...
Keiji Yanai, Masaya Shindo, Kohei Noshita
243
Voted
ACL
1998
15 years 3 months ago
Maximum Entropy Model Learning of the Translation Rules
This paper proposes a learning method of translation rules from parallel corpora. This method applies the maximum entropy principle to a probabilistic model of translation rules. ...
Kengo Sato, Masakazu Nakanishi
IPPS
2003
IEEE
15 years 7 months ago
A Case Study of Selected SPLASH-2 Applications and the SBT Debugging Tool
SBT is portable library and tool for on-line debugging and performance monitoring of shared-memory parallel programs using the single-program-multiple-data (SPMD) model of paralle...
Ernesto Novillo, Paul Lu
ISCA
1997
IEEE
104views Hardware» more  ISCA 1997»
15 years 6 months ago
Complexity-Effective Superscalar Processors
The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, ...
Subbarao Palacharla, Norman P. Jouppi, James E. Sm...
131
Voted
SDM
2008
SIAM
136views Data Mining» more  SDM 2008»
15 years 3 months ago
Exploration and Reduction of the Feature Space by Hierarchical Clustering
In this paper we propose and test the use of hierarchical clustering for feature selection. The clustering method is Ward's with a distance measure based on GoodmanKruskal ta...
Dino Ienco, Rosa Meo