Sciweavers

529 search results - page 98 / 106
» Optimizing the distribution of large data sets in theory and...
Sort
View
PR
2008
206views more  PR 2008»
13 years 7 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
VLDB
1992
ACM
151views Database» more  VLDB 1992»
13 years 11 months ago
Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB
This paper evaluates the performance of the parallel, main-memory DBMS, PRISMA/DB. First, an architecture for parallel query execution is presented. A performance model for the ex...
Annita N. Wilschut, Jan Flokstra, Peter M. G. Aper...
RECOMB
2004
Springer
14 years 8 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 27 days ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
AI
2010
Springer
13 years 7 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...