1091 search results - page 56 / 219 » On the temporal dimension of search |
128
Voted
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
108
click to vote
ASIAMS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and th...
110
Voted
CCCG
2010
15 years 3 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
124
click to vote
KES
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Search engines traditionally index unstructured text and return ranked lists of documents that match a given query. As search engines functionally move in the direction o...
94
Voted
ANTSW
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to mul...