776 search results - page 2 / 156 » Distributed Information Regularization on Graphs |
TKDE
2012
11 years 7 months ago
2012
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...
JMLR
2010
12 years 11 months ago
2010
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
EDBTW
2006
Springer
13 years 8 months ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...