Sciweavers

4541 search results - page 142 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICRA
2009
IEEE
163views Robotics» more  ICRA 2009»
15 years 9 months ago
3D tree reconstruction from laser range data
— We present a method for reconstructing 3D models of tree branch structure from laser range data. Our approach is probabilistic, and uses a generative model of a tree to guide a...
Jonathan Binney, Gaurav S. Sukhatme
ESOP
2004
Springer
15 years 8 months ago
Adaptive Pattern Matching on Binary Data
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...
Per Gustafsson, Konstantinos F. Sagonas
PPOPP
2012
ACM
13 years 10 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 3 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
ICPR
2004
IEEE
16 years 4 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo