Sciweavers

4541 search results - page 383 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICDT
2011
ACM
232views Database» more  ICDT 2011»
14 years 8 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
SODA
2003
ACM
139views Algorithms» more  SODA 2003»
15 years 6 months ago
Compact representations of separable graphs
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
SODA
2003
ACM
112views Algorithms» more  SODA 2003»
15 years 6 months ago
Perturbations and vertex removal in a 3D delaunay triangulation
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
Olivier Devillers, Monique Teillaud
BIOCOMP
2008
15 years 6 months ago
Semantic Discovery of Protein Web Services
- Integrating information about protein sequence and structure allows further exploration and establishment of protein sequence-structure-function relations. However, protein data ...
Xiong Liu, Hassan A. Karimi
RAS
2010
127views more  RAS 2010»
15 years 3 months ago
Maximum-likelihood sample-based maps for mobile robots
— The problem of representing environments of a mobile robot has been studied intensively in the past. The predominant approaches for geometric representations are gridbased or l...
Daniel Meyer-Delius, Wolfram Burgard