11211 search results - page 188 / 2243 » Data Structures |
180
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
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...
188
click to vote
IBERAMIA
2010
Springer
15 years 5 months ago
2010
Springer
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional depe...
168
click to vote
IOPADS
1996
15 years 7 months ago
1996
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 ...
139
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
178
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
There is a ever-growing need to add structure in the form of semantic markup to the huge amounts of unstructured text data now available. We present the technique of shallow seman...