736 search results - page 31 / 148 » A dynamic data structure for approximate range searching |
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD (content-based copy detection) of images and video. They include two steps...
NIPS
1998
13 years 10 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...