927 search results - page 145 / 186 » A comparison of two approaches to pseudorandomness |
PR
2006
14 years 11 months ago
2006
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...
111
click to vote
IPM
2007
14 years 11 months ago
2007
This study proposes the codification of lexical information in electronic dictionaries, in accordance with a generic and extendable XML scheme model, and its conjunction with lin...
IGARSS
2010
14 years 9 months ago
2010
Spectral unmixing is an important task for remotely sensed hyperspectral data exploitation. Linear spectral unmixing relies on two main steps: 1) identification of pure spectral c...
140
click to vote
PAMI
2012
13 years 2 months ago
2012
—Many face recognition algorithms use “distance-based” methods: Feature vectors are extracted from each face and distances in feature space are compared to determine matches....
DAC
2000
ACM
16 years 24 days ago
2000
ACM
This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the stateof-the-art after two decades of research in recursive ...