Sciweavers

11212 search results - page 637 / 2243
» Semi-persistent Data Structures
Sort
View
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
SIGOPS
2010
91views more  SIGOPS 2010»
15 years 5 months ago
FastAD: an authenticated directory for billions of objects
We develop techniques that make authenticated directories efficient and scalable toward the goal of managing tens of billions of objects in a single directory. Internet storage s...
Paul T. Stanton, Benjamin McKeown, Randal C. Burns...
ACL
2009
15 years 5 months ago
A Succinct N-gram Language Model
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of Ngram language models based on LOUDS, a succinct data stru...
Taro Watanabe, Hajime Tsukada, Hideki Isozaki