Sciweavers

1550 search results - page 96 / 310
» Benchmarking for Graph Transformation
Sort
View
ASYNC
2004
IEEE
121views Hardware» more  ASYNC 2004»
15 years 7 months ago
Static Tokens: Using Dataflow to Automate Concurrent Pipeline Synthesis
We describe a new intermediate compiler representation, static token form, that is suitable for dataflow-style synthesis of high-level asynchronous specifications. Static token fo...
John Teifel, Rajit Manohar
IPL
2010
65views more  IPL 2010»
15 years 1 months ago
Multicasting in the hypercube, chord and binomial graphs
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
Christopher C. Cipriano, Teofilo F. Gonzalez
PPDP
2010
Springer
15 years 1 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
AVI
2006
15 years 4 months ago
Task taxonomy for graph visualization
Our goal is to define a list of tasks for graph visualization that has enough detail and specificity to be useful to designers who want to improve their system and to evaluators w...
Bongshin Lee, Catherine Plaisant, Cynthia Sims Par...
PCM
2007
Springer
114views Multimedia» more  PCM 2007»
15 years 9 months ago
Random Convolution Ensembles
A novel method for creating diverse ensembles of image classifiers is proposed. The idea is that, for each base image classifier in the ensemble, a random image transformation is g...
Michael Mayo