Sciweavers

245 search results - page 25 / 49
» Finding common structured patterns in linear graphs
Sort
View
CASES
2010
ACM
14 years 7 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
COLT
2004
Springer
15 years 3 months ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
ASAP
2004
IEEE
102views Hardware» more  ASAP 2004»
15 years 1 months ago
A Hierarchical Classification Scheme to Derive Interprocess Communication in Process Networks
The Compaan compiler automatically derives a Process Network (PN) description from an application written in Matlab. The basic element of a PN is a Producer/Consumer (P/C) pair. F...
Alexandru Turjan, Bart Kienhuis, Ed F. Deprettere
HICSS
2011
IEEE
179views Biometrics» more  HICSS 2011»
14 years 1 months ago
EventGraphs: Charting Collections of Conference Connections
EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common “hashtag” or keyword to identi...
Derek L. Hansen, Marc A. Smith, Ben Shneiderman
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
15 years 11 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou