3359 search results - page 448 / 672 » A Simplified Idea Algorithm |
99
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
96
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
103
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
WEBI
2009
Springer
15 years 7 months ago
2009
Springer
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
78
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...