Sciweavers

164 search results - page 6 / 33
» Maximally joining probabilistic data
Sort
View
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
15 years 11 months ago
Integrating and Ranking Uncertain Scientific Data
Mediator-based data integration systems resolve exploratory queries by joining data elements across sources. In the presence of uncertainties, such multiple expansions can quickly ...
Landon Detwiler, Wolfgang Gatterbauer, Brenton Lou...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 3 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
INFFUS
2008
175views more  INFFUS 2008»
14 years 9 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
EDBT
2006
ACM
130views Database» more  EDBT 2006»
15 years 9 months ago
Querying and Updating Probabilistic Information in XML
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
Serge Abiteboul, Pierre Senellart
NIPS
1998
14 years 11 months ago
Robot Docking Using Mixtures of Gaussians
This paper applies the Mixture of Gaussians probabilistic model, combined with Expectation Maximization optimization to the task of summarizing three dimensional range data for a ...
Matthew M. Williamson, Roderick Murray-Smith, Volk...