Sciweavers

11212 search results - page 97 / 2243
» Semi-persistent Data Structures
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 11 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
ACTAC
1998
71views more  ACTAC 1998»
13 years 9 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
IOPADS
1996
87views more  IOPADS 1996»
13 years 11 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
CANDC
2002
ACM
13 years 10 months ago
A Tool for the Interactive 3D Visualization of Electronic Structure in Molecules and Solids
This paper presents the Vienna ab initio simulation package (VASP) data viewer, a desktop 3D visualization application for the analysis of valence electronic structure information...
Timothy B. Terriberry, David F. Cox, Doug A. Bowma...
BPM
2006
Springer
98views Business» more  BPM 2006»
14 years 1 months ago
Structured Service Composition
Composition languages like BPEL and many enactment tools only support structured process models, while most composition approaches only consider unstructured models. In this paper,...
Rik Eshuis, Paul W. P. J. Grefen, Sven Till