Sciweavers

17967 search results - page 3137 / 3594
» Functional timing optimization
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
LICS
1997
IEEE
15 years 10 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
COMPGEOM
1997
ACM
15 years 10 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 10 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
PPOPP
1997
ACM
15 years 10 months ago
Compiling Dynamic Mappings with Array Copies
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
Fabien Coelho
« Prev « First page 3137 / 3594 Last » Next »