Sciweavers

107 search results - page 2 / 22
» A methodology for creating fast wait-free data structures
Sort
View
IJRR
2007
171views more  IJRR 2007»
14 years 9 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars
109
Voted
BMCBI
2011
14 years 1 months ago
A fast and accurate method to detect allelic genomic imbalances underlying mosaic rearrangements using SNP array data
Background: Mosaicism for copy number and copy neutral chromosomal rearrangements has been recently identified as a relatively common source of genetic variation in the normal pop...
Juan R. González, Benjamin Rodriguez-Santia...
ASPLOS
2011
ACM
14 years 1 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
IADIS
2003
14 years 11 months ago
Model Driven Fast Prototyping: A Semantic Approach
Sure that quality applications must be well thought and described before the development phase and that a design methodology can be much more than a help in most occasions, we pro...
Luca Contursi, Roberto Paiano, Andrea Pandurino
VLDB
2001
ACM
153views Database» more  VLDB 2001»
15 years 1 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...