Sciweavers

683 search results - page 51 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
ISBRA
2007
Springer
14 years 2 months ago
Reconstruction of 3D Structures from Protein Contact Maps
Proteins are large organic compounds made of amino acids arranged in a linear chain (primary structure). Most proteins fold into unique threedimensional (3D) structures called inte...
Marco Vassura, Luciano Margara, Filippo Medri, Pie...
PODC
1990
ACM
13 years 12 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
14 years 2 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
CGF
2008
227views more  CGF 2008»
13 years 8 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...