3223 search results - page 121 / 645 » The Scaling of Search Cost |
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
ICDCS
1999
IEEE
14 years 2 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
EMNLP
2007
13 years 11 months ago
2007
This paper describes ETK (Ensemble of Transformation based Keys) a new algorithm for inducing search keys for name ïŹltering. ETK has the low computational cost and ability to ïŹ...
JSAC
2007
13 years 9 months ago
2007
âThis paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Recently, advances have been made in continuous, normalâ distributionâbased EstimationâofâDistribution Algorithms (EDAs) by scaling the variance up from the maximumâlike...