Sciweavers

70 search results - page 13 / 14
» Type Safe Algorithmic Skeletons
Sort
View
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
13 years 10 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
BMCBI
2005
99views more  BMCBI 2005»
13 years 5 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
GIS
2008
ACM
13 years 6 months ago
Automatic extraction of road intersection position, connectivity, and orientations from raster maps
The road network is one of the most important types of information on raster maps. In particular, the set of road intersection templates, which consists of the road intersection p...
Yao-Yi Chiang, Craig A. Knoblock
PG
2007
IEEE
13 years 11 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain
ANSS
1998
IEEE
13 years 9 months ago
An Adaptive Synchronization Protocol for Parallel Discrete Event Simulation
Simulation, especially discrete event simulation (DES), is used in a variety of disciplines where numerical methods are difficult or impossible to apply. One problem with this met...
Keith R. Bisset