Sciweavers

76 search results - page 11 / 16
» Compounding of gossip graphs
Sort
View
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
GCB
2009
Springer
139views Biometrics» more  GCB 2009»
13 years 11 months ago
Graph-Kernels for the Comparative Analysis of Protein Active Sites
Abstract: Graphs are often used to describe and analyze the geometry and physicochemical composition of biomolecular structures, such as chemical compounds and protein active sites...
Thomas Fober, Marco Mernberger, Ralph Moritz, Eyke...
FLAIRS
2006
13 years 8 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 7 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
TIT
2008
103views more  TIT 2008»
13 years 7 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah