Sciweavers

5244 search results - page 443 / 1049
» Structural Complexity of AvgBPP
Sort
View
213
Voted
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 10 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
170
Voted
SC
1995
ACM
15 years 10 months ago
Index Array Flattening Through Program Transformation
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
Raja Das, Paul Havlak, Joel H. Saltz, Ken Kennedy
223
Voted
AIIA
1991
Springer
15 years 10 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
192
Voted
VLDB
1987
ACM
93views Database» more  VLDB 1987»
15 years 10 months ago
FAD, a Powerful and Simple Database Language
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
François Bancilhon, Ted Briggs, Setrag Khos...
SIGGRAPH
2010
ACM
15 years 10 months ago
A wave-based anisotropic quadrangulation method
This paper proposes a new method for remeshing a surface into anisotropically sized quads. The basic idea is to construct a special standing wave on the surface to generate the gl...
Muyang Zhang, Jin Huang, Xinguo Liu, Hujun Bao