Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
7,777
Adaptive Reduction Parallelization Techniques
- In Proceedings of the 2000 International Conference on Supercomputing
, 2000
"... In this paper, we propose to adapt parallelizing transformations, more specifically, reduction parallelizations, to the actual reference pattern executed by a loop, i.e., to the particular input data and dynamic phase of a program. More precisely we will show how, after validating a reduction at run ..."
Abstract
-
Cited by 35 (5 self)
- Add to MetaCart
In this paper, we propose to adapt parallelizing transformations, more specifically, reduction parallelizations, to the actual reference pattern executed by a loop, i.e., to the particular input data and dynamic phase of a program. More precisely we will show how, after validating a reduction
Adaptive reduction-based AMG
- NUMER. LINEAR ALGEBRA APPL.
, 2005
"... With the ubiquity of large-scale computing resources has come significant attention to practical details of fast algorithms for the numerical solution of partial differential equations. Included in this group are the class of multigrid and algebraic multigrid algorithms that are effective solvers fo ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
less is known about the problem matrix, an adaptive version of AMGr that automatically determines the form of the reduction needed by the AMGr process is proposed. The adaptive cycle is shown, in both theory and practice, to yield an effective AMGr algorithm.
A Syntactic Approach to Type Soundness
- INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract
-
Cited by 629 (22 self)
- Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
Energy-efficient communication protocol for wireless microsensor networks
, 2000
"... Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our f ..."
Abstract
-
Cited by 2103 (10 self)
- Add to MetaCart
findings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local
A photometric adaptation of the Somogyi method for the determination of glucose
- J. Biol. Chem. 1944
"... The reliability of the various Somogyi-Shaffer-Hartmann (1, 2) copper reagents for glucose determination in biological material has been estab-lished. Adaptation of these reagents to calorimetric use may be accom-plished by omission of the iodide and iodate in their preparation, since these interfer ..."
Abstract
-
Cited by 410 (0 self)
- Add to MetaCart
and reproducibility of color. By this means it has been possible to utilize the copper reagents in a photometric procedure for practically all the uses to which the titri-metric procedures are adapted. These include tissue sugar, glycogen, urine reduction equivalent, maltose, glucuronic acid, etc. However, diastase
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
- In proceedings of ACM SIGMOD Conference on Management of Data
, 2002
"... Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data.. The most promising solutions' involve performing dimensionality reduction on the data, then indexing the reduced d ..."
Abstract
-
Cited by 316 (33 self)
- Add to MetaCart
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data.. The most promising solutions' involve performing dimensionality reduction on the data, then indexing the reduced
Complete Sets under Non-Adaptive Reductions are Scarce
, 1997
"... We investigate the frequency of complete sets for various complexity classes within EXP under non-adaptive reductions in the sense of resource bounded measure. We show that these sets are rare: ffl The sets that are complete under 6 p n ff \Gammatt -reductions for NP, the levels of the polynomial- ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We investigate the frequency of complete sets for various complexity classes within EXP under non-adaptive reductions in the sense of resource bounded measure. We show that these sets are rare: ffl The sets that are complete under 6 p n ff \Gammatt -reductions for NP, the levels of the polynomial
Discriminant adaptive nearest neighbor classification,
, 1995
"... Abstract Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear discrimin ..."
Abstract
-
Cited by 321 (1 self)
- Add to MetaCart
Abstract Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear
The density of weakly complete problems under adaptive reductions
- SIAM Journal on Computing
"... Given a real number <1, every language that is weakly P n =2;T-hard for E or weakly P n;T-hard for E2 is shown to be exponentially dense. This simultaneously strengthens results of Lutz and Mayordomo(1994) and Fu(1995). 1 ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
Given a real number <1, every language that is weakly P n =2;T-hard for E or weakly P n;T-hard for E2 is shown to be exponentially dense. This simultaneously strengthens results of Lutz and Mayordomo(1994) and Fu(1995). 1
Results 1 - 10
of
7,777
