Sciweavers

2477 search results - page 454 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
NETWORKS
2010
15 years 9 days ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
CASES
2010
ACM
14 years 12 months ago
Fine-grain dynamic instruction placement for L0 scratch-pad memory
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm ca...
JongSoo Park, James D. Balfour, William J. Dally

Publication
141views
14 years 2 days ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano
VIS
2004
IEEE
136views Visualization» more  VIS 2004»
16 years 3 months ago
Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
15 years 10 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...