1100 search results - page 163 / 220 » Approximate distance oracles |
COCOON
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
ISMIR
2000
Springer
15 years 1 months ago
2000
Springer
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
DIALM
2008
ACM
14 years 11 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
NIPS
2008
14 years 11 months ago
2008
Learning in real-time applications, e.g., online approximation of the inverse dynamics model for model-based robot control, requires fast online regression techniques. Inspired by...
NIPS
2007
14 years 11 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...