5169 search results - page 191 / 1034 » Locality approximation using time |
198
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
160
click to vote
APPT
2005
Springer
15 years 11 months ago
2005
Springer
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...
172
click to vote
JMLR
2010
15 years 1 months ago
2010
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
201
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
162
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...