776 search results - page 65 / 156 » Distributed Information Regularization on Graphs |
98
Voted
PAKDD
1999
ACM
15 years 4 months ago
1999
ACM
Empirical equations are an important class of regularities that can be discovered in databases. In this paper we concentrate on the role of equations as de nitions of attribute val...
107
Voted
AAAI
2008
15 years 2 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
198
Voted
SIGMOD
2008
ACM
16 years 21 days ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
100
click to vote
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
90
Voted
PDCAT
2007
Springer
15 years 6 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...