Sciweavers

4972 search results - page 746 / 995
» Ranking on graph data
Sort
View
TAPSOFT
1997
Springer
15 years 10 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
CIKM
1993
Springer
15 years 10 months ago
Model-driven Hypermedia Access to Weather Information
: A framework is presented for hypermedia access to weather information originating from gridded data sets. The information is presented on different media (map, text, graph, table...
Stephan M. Kerpedjiev
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
15 years 10 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...
KDD
1995
ACM
106views Data Mining» more  KDD 1995»
15 years 10 months ago
Structured and Unstructured Induction with EDAGs
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
Brian R. Gaines
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
15 years 10 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint