9849 search results - page 287 / 1970 » Algorithms and Experiments for the Webgraph |
325
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
177
click to vote
ICASSP
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
240
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
198
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
189
click to vote
IJCNN
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— This paper considers the basis vector selection issue invloved in forward selection algorithms to sparse Gaussian Process Regression (GPR). Firstly, we re-examine a pre...