Sciweavers

6 search results - page 1 / 2
» Splitting Theorems and the Jump Operator
Sort
View
66
Voted
APAL
1998
71views more  APAL 1998»
14 years 9 months ago
Splitting Theorems and the Jump Operator
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
Rodney G. Downey, Richard A. Shore
VMV
2004
208views Visualization» more  VMV 2004»
14 years 11 months ago
Fourier Volume Rendering on the GPU Using a Split-Stream-FFT
The Fourier volume rendering technique operates in the frequency domain and creates line integral projections of a 3D scalar field. These projections can be efficiently generated ...
Thomas Jansen, Bartosz von Rymon-Lipinski, Nils Ha...
ISCI
2007
135views more  ISCI 2007»
14 years 9 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
79
Voted
LPNMR
1997
Springer
15 years 1 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
DAM
2008
84views more  DAM 2008»
14 years 9 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti