447 search results - page 69 / 90 » Linear discriminant analysis for data with subcluster struct... |
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap ...
ISBI
2007
IEEE
15 years 4 months ago
2007
IEEE
Optical imaging is a powerful technique to map brain function in animals. In this study, we consider in vivo optical imaging of the murine olfactory bulb, using an intrinsic signa...
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
KDD
1998
ACM
15 years 2 months ago
1998
ACM
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...