304 search results - page 16 / 61 » Dynamic ordered sets with exponential search trees |
98
Voted
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
A prototype-based approach is introduced for action
recognition. The approach represents an action as a se-
quence of prototypes for efficient and flexible action match-
ing in ...
194
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
133
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
AAAI
2000
15 years 1 months ago
2000
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
101
click to vote
ISMIR
2005
Springer
15 years 5 months ago
2005
Springer
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...