Sciweavers

4541 search results - page 749 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
170
Voted
SGP
2003
15 years 8 months ago
Approximating and Intersecting Surfaces from Points
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...
Anders Adamson, Marc Alexa
IJCAI
1997
15 years 8 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
USENIX
1990
15 years 7 months ago
A New Design for Distributed Systems: The Remote Memory Model
This paper describes a new model for constructing distributed systems called the Remote Memory Model. The remote memory model consists of several client machines, one or more dedi...
Douglas Comer, Jim Griffioen
ACCV
2009
Springer
15 years 7 months ago
Adaptive-Scale Robust Estimator Using Distribution Model Fitting
We propose a new robust estimator for parameter estimation in highly noisy data with multiple structures and without prior information on the noise scale of inliers. This is a diag...
Trung Ngo Thanh, Hajime Nagahara, Ryusuke Sagawa, ...
CF
2010
ACM
15 years 6 months ago
Efficient cache design for solid-state drives
Solid-State Drives (SSDs) are data storage devices that use solid-state memory to store persistent data. Flash memory is the de facto nonvolatile technology used in most SSDs. It ...
Miaoqing Huang, Olivier Serres, Vikram K. Narayana...