Sciweavers

1691 search results - page 180 / 339
» Restricted subset selection
Sort
View
162
Voted
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 3 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
PAMI
1998
127views more  PAMI 1998»
15 years 3 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
122
Voted
SAC
2008
ACM
15 years 3 months ago
Filtering drowsy instruction cache to achieve better efficiency
Leakage power in cache memories represents a sizable fraction of total power consumption, and many techniques have been proposed to reduce it. As a matter of fact, during a fixed ...
Roberto Giorgi, Paolo Bennati
150
Voted
JRTIP
2008
151views more  JRTIP 2008»
15 years 2 months ago
Automatic gender recognition based on pixel-pattern-based texture feature
A pixel-pattern-based texture feature (PPBTF) is proposed for real-time gender recognition. A gray-scale image is transformed into a pattern map where edges and lines are to be use...
Huchuan Lu, Yingjie Huang, Yen-Wei Chen, Deli Yang
118
Voted
ICASSP
2010
IEEE
15 years 1 months ago
Learning from other subjects helps reducing Brain-Computer Interface calibration time
A major limitation of Brain-Computer Interfaces (BCI) is their long calibration time, as much data from the user must be collected in order to tune the BCI for this target user. I...
Fabien Lotte, Cuntai Guan