1605 search results - page 175 / 321 » On Partitional Labelings of Graphs |
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
ICCD
2002
IEEE
14 years 7 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
ASIACRYPT
2010
Springer
13 years 8 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
DCC
2005
IEEE
14 years 10 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...