688 search results - page 92 / 138 » Computing with subspaces |
76
Voted
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
We describe a system designed for automatic extraction and segmentation of didjeridu and clapsticks from certain styles of traditional Aboriginal Australian music. For didjeridu, ...
ICCBR
2003
Springer
15 years 2 months ago
2003
Springer
In the CBR literature from the past 25 years there is a considerable amount of research work that makes use of cases that are subspaces of some representation space rather than poi...
IWANN
2009
Springer
15 years 2 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
ECSQARU
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
103
click to vote
PAKDD
2000
ACM
15 years 1 months ago
2000
ACM
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...