6045 search results - page 1129 / 1209 » Computable Linearizations of Well-partial-orderings |
ICLP
1997
Springer
14 years 1 days ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
VLDB
1997
ACM
14 years 1 days ago
1997
ACM
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
WADS
1997
Springer
14 years 1 days ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
VISUALIZATION
1993
IEEE
14 years 16 hour ago
1993
IEEE
Fast techniques for direct volume rendering over curvilinear grids of hexahedral cells are developed. This type of 3D grid is common in computational uid dynamics and nite element...
COMPGEOM
1993
ACM
14 years 5 hour ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...