Sciweavers

2104 search results - page 94 / 421
» Sorting with networks of data structures
Sort
View
ICML
2000
IEEE
16 years 5 months ago
Learning Bayesian Networks for Diverse and Varying numbers of Evidence Sets
We introduce an expandable Bayesian network (EBN) to handle the combination of diverse multiple homogeneous evidence sets. An EBN is an augmented Bayesian network which instantiat...
Zu Whan Kim, Ramakant Nevatia
SIGMOD
2006
ACM
174views Database» more  SIGMOD 2006»
16 years 4 months ago
Dynamic authenticated index structures for outsourced databases
In outsourced database (ODB) systems the database owner publishes its data through a number of remote servers, with the goal of enabling clients at the edge of the network to acce...
Feifei Li, Marios Hadjieleftheriou, George Kollios...
BIOCOMP
2006
15 years 5 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 9 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
ICANN
2007
Springer
15 years 10 months ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...