Sciweavers

2018 search results - page 362 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CIKM
2004
Springer
14 years 3 months ago
A practical web-based approach to generating topic hierarchy for text segments
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...
Shui-Lung Chuang, Lee-Feng Chien
PODS
2010
ACM
150views Database» more  PODS 2010»
14 years 2 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
GECCO
2010
Springer
237views Optimization» more  GECCO 2010»
14 years 2 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
14 years 2 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
14 years 1 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran