Sciweavers

1648 search results - page 37 / 330
» On the generation of bicliques of a graph
Sort
View
CIKM
2009
Springer
15 years 4 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
IDA
2007
Springer
14 years 9 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ASUNAM
2011
IEEE
13 years 9 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh
DCC
2001
IEEE
15 years 9 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
ICCD
2008
IEEE
151views Hardware» more  ICCD 2008»
15 years 6 months ago
Digital filter synthesis considering multiple adder graphs for a coefficient
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...
Jeong-Ho Han, In-Cheol Park