4541 search results - page 435 / 909 » Cache-Oblivious Algorithms and Data Structures |
183
click to vote
SCHOLARPEDIA
2008
15 years 3 months ago
2008
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
156
click to vote
NIPS
1998
15 years 6 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
172
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
136
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...
127
click to vote
IEEESCC
2008
IEEE
15 years 11 months ago
2008
IEEE
Interpreting legacy XML documents is a great challenge for realizing the vision of the Semantic Web (SW). This paper presents an algorithm to transform XML data into RDF- foundati...