Sciweavers

125 search results - page 25 / 25
» Computing Pool: A Simplified and Practical Computational Gri...
Sort
View
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 8 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ECCV
2000
Springer
14 years 6 months ago
Camera Pose Estimation and Reconstruction from Image Profiles under Circular Motion
Abstract. This paper addresses the problem of motion estimation and reconstruction of 3D models from profiles of an object rotating on a turntable, obtained from a single camera. I...
Paulo R. S. Mendonça, Kwan-Yee Kenneth Wong...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
13 years 11 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
BMCBI
2010
183views more  BMCBI 2010»
13 years 5 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
AGTIVE
2003
Springer
13 years 10 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman