• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 21,500
Next 10 →

Introduction Intermediate results

by Main Proof
"... Why it does work Small time existence of the flow of a viscoelastic ..."
Abstract - Add to MetaCart
Why it does work Small time existence of the flow of a viscoelastic

Intermediate Results Dissemination Workshop

by Seleshi B. Awulachew, Teklu Erkossa, Vladimir Smakhtin, Ashra Fernando, Dependent On The Blue Nile, Seleshi B. Awulachew, Teklu Erkossa, Vladimir Smakhtin , 2009
"... Compiled by ..."
Abstract - Add to MetaCart
Compiled by

-INTERMEDIATE RESULTS OF THE NOROSEE EXPERIMENT

by V. Hesany, R. Lawner, S. Gogineni , 1984
"... Supported by:MA1 185 3 ..."
Abstract - Add to MetaCart
Supported by:MA1 185 3

Recycling intermediate results in pipelined . . .

by Fabian Nagel , 2010
"... ..."
Abstract - Add to MetaCart
Abstract not found

Caching intermediate results for program improvement

by Yanhong A. Liu, Tim Teitelbaum - In Proceedings of the 1995 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM ’95 , 1995
"... A systematic approach is given for symbolically caching intermediate results useful for deriving incremental programs from non-incremental programs. We exploit a number of program analysis and transformation techniques, centered around e ective c a c hing based on its utilization in deriving increme ..."
Abstract - Cited by 22 (6 self) - Add to MetaCart
A systematic approach is given for symbolically caching intermediate results useful for deriving incremental programs from non-incremental programs. We exploit a number of program analysis and transformation techniques, centered around e ective c a c hing based on its utilization in deriving

CIL: Intermediate language and tools for analysis and transformation of C programs

by George C. Necula, Scott Mcpeak, Shree P. Rahul, Westley Weimer - In International Conference on Compiler Construction , 2002
"... Abstract. This paper describes the CIntermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C programs. Compared to C, CIL has fewer constructs. It breaks down certain complicated constructs of C into simpler ones, ..."
Abstract - Cited by 533 (11 self) - Add to MetaCart
, and thus it works at a lower level than abstract-syntax trees. But CIL is also more high-level than typical intermediate languages (e.g., three-address code) designed for compilation. As a result, what we have is a representation that makes it easy to analyze and manipulate C programs, and emit them in a

Caching Intermediate Result of SPARQL Queries

by Mengdong Yang, Gang Wu
"... The complexity and growing scale of RDF data has made data management back end the performance bottleneck of Semantic Web applications. Caching is one of the ways that could solve this problem. However, few existing research projects focus on caching in RDF data processing. We present an adaptive ca ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
caching scheme that caches intermediate result of basic graph pattern SPARQL queries. Benchmark test results are provided to illustrate the effectiveness of our caching scheme.

Buffering of Intermediate Results in Dataflow Diagrams

by Allison Woodruff, Michael Stonebraker - In Proceedings VL'95 11th International IEEE Symposium on Visual Languages , 1995
"... Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. We define the optimal buffer allocation problem of determining the buffer contents which minimize the average response ti ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. We define the optimal buffer allocation problem of determining the buffer contents which minimize the average response

Buffering of Intermediate Results in Dataflow Diagrams

by Allison Woodruff, Michael Stonebraker - IN PROCEEDINGS VL'95 11TH INTERNATIONAL IEEE SYMPOSIUM ON VISUAL LANGUAGES , 1995
"... Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. We define the optimal buffer allocation problem of determining the buffer contents which minimize the average response ti ..."
Abstract - Add to MetaCart
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. We define the optimal buffer allocation problem of determining the buffer contents which minimize the average response

Buffering of Intermediate Results in Dataflow Diagrams

by Allison Woodruff, Michael Stonebraker - IN PROCEEDINGS VL'95 11TH INTERNATIONAL IEEE SYMPOSIUM ON VISUAL LANGUAGES , 1995
"... Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. We define the optimal buffer allocation problem of determining the buffer contents which minimize the average response ti ..."
Abstract - Add to MetaCart
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. We define the optimal buffer allocation problem of determining the buffer contents which minimize the average response
Next 10 →
Results 1 - 10 of 21,500
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University