1091 search results - page 49 / 219 » On the temporal dimension of search |
139
click to vote
CIVR
2007
Springer
15 years 7 months ago
2007
Springer
Among the various types of semantic concepts modeled, events pose the greatest challenge in terms of computational power needed to represent the event and accuracy that can be ach...
113
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
107
Voted
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...
250
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
PR
2007
15 years 1 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...