144 search results - page 22 / 29 » Non-blocking binary search trees |
KDD
2004
ACM
14 years 10 months ago
2004
ACM
Personalized search has gained great popularity to improve search effectiveness in recent years. The objective of personalized search is to provide users with information tailored ...
PPSC
2001
13 years 11 months ago
2001
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
IPL
2010
13 years 8 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
Reducing the dimension of local descriptors in images is useful to perform pixels comparison faster. We show here that, for enhancing and optimising the computation of the NL-mean...