2600 search results - page 107 / 520 » Clustering with or without the Approximation |
113
click to vote
FPL
2006
Springer
15 years 5 months ago
2006
Springer
This paper presents a hardware architecture for non-uniform random number generation, which allows the generator's distribution to be modified at run-time without reconfigura...
225
click to vote
ICDE
2000
IEEE
16 years 2 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
192
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
116
click to vote
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
111
click to vote
SCCC
2003
IEEE
15 years 6 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...