Sciweavers

185 search results - page 1 / 37
» An Executable Representation of Distance and Direction
Sort
View
LCPC
1991
Springer
13 years 8 months ago
An Executable Representation of Distance and Direction
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
Richard Johnson, Wei Li, Keshav Pingali
IJCAI
1997
13 years 6 months ago
Implementing BDI-like Systems by Direct Execution
While the Belief, Desire, Intention (BDI) framework is one of the most influential and appealing approaches to rational agent architectures, a gulf often exists between the high-l...
Michael Fisher
DCC
2011
IEEE
13 years 8 days ago
Directed graph representation of half-rate additive codes over GF(4)
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...
Lars Eirik Danielsen, Matthew G. Parker
DBPL
1999
Springer
122views Database» more  DBPL 1999»
13 years 9 months ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su
SIGGRAPH
2000
ACM
13 years 9 months ago
Adaptively sampled distance fields: a general representation of shape for computer graphics
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
Sarah F. Frisken Gibson, Ronald N. Perry, Alyn P. ...