5169 search results - page 114 / 1034 » Locality approximation using time |
161
click to vote
CGF
2005
15 years 4 months ago
2005
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampl...
165
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
130
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
159
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
We present a novel mixed-state dynamic Bayesian network (DBN) framework for modeling and classifying timeseries data such as object trajectories. A hidden Markov model (HMM) of di...
156
click to vote
JSAC
2008
15 years 4 months ago
2008
Abstract-- We explore the performance and hardware complexity tradeoffs associated with performing iterative multipleinput multiple-output (MIMO) detection using a sphere decoder a...