Sciweavers

1381 search results - page 98 / 277
» Structural signatures for tree data structures
Sort
View
AUSAI
2006
Springer
15 years 1 months ago
Learning Hybrid Bayesian Networks by MML
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb
DEBS
2007
ACM
14 years 11 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
ISBI
2011
IEEE
14 years 1 months ago
Reliable cell tracking by global data association
Automated cell tracking in populations is important for research and discovery in biology and medicine. In this paper, we propose a cell tracking method based on global spatiotemp...
Ryoma Bise, Zhaozheng Yin, Takeo Kanade
ADBIS
2006
Springer
103views Database» more  ADBIS 2006»
15 years 3 months ago
RA: An XML Schema Reduction Algorithm
XML file comparison and clustering are two challenging tasks still accomplished predominantly manually. XML schema contains information about data structure, types, and labels fou...
Angela Cristina Duta, Ken Barker, Reda Alhajj
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
14 years 11 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount