Sciweavers

1188 search results - page 13 / 238
» Extended Graph Unification
Sort
View
DAC
2002
ACM
14 years 10 months ago
Efficient code synthesis from extended dataflow graphs for multimedia applications
This paper presents efficient automatic code synthesis techniques from dataflow graphs for multimedia applications. Since multimedia applications require large size buffers contai...
Hyunok Oh, Soonhoi Ha
ENDM
2007
73views more  ENDM 2007»
13 years 9 months ago
Two New Classes of Hamiltonian Graphs: (Extended Abstract)
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
CONEXT
2009
ACM
13 years 11 months ago
Where the sidewalk ends: extending the internet as graph using traceroutes from P2P users
An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping effor...
Kai Chen, David R. Choffnes, Rahul Potharaju, Yan ...
BIRTHDAY
2010
Springer
13 years 10 months ago
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
Moa Johansson, Lucas Dixon, Alan Bundy
LPAR
2010
Springer
13 years 7 months ago
Disunification for Ultimately Periodic Interpretations
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...
Matthias Horbach