Sciweavers

11213 search results - page 431 / 2243
» Low-contention data structures
Sort
View
IJFCS
2002
122views more  IJFCS 2002»
15 years 6 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 5 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 5 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts
ICTAC
2010
Springer
15 years 5 months ago
Formal Modelling of Separation Kernel Components
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
Andrius Velykis, Leo Freitas
PVM
2010
Springer
15 years 5 months ago
MPI Datatype Marshalling: A Case Study in Datatype Equivalence
MPI datatypes are a convenient abstraction for manipulating complex data structures and are useful in a number of contexts. In some cases, these descriptions need to be preserved o...
Dries Kimpe, David Goodell, Robert B. Ross