1032 search results - page 200 / 207 » Extended Computation Tree Logic |
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
In a recent paper, Friedman, Geiger, and Goldszmidt [8] introduced a classifier based on Bayesian networks, called Tree Augmented Naive Bayes (TAN), that outperforms naive Bayes a...
107
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
139
click to vote
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
113
click to vote
SIGMOD
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...