Sciweavers

164 search results - page 21 / 33
» Maximally joining probabilistic data
Sort
View
COMAD
2009
14 years 10 months ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
84
Voted
ICDM
2007
IEEE
184views Data Mining» more  ICDM 2007»
15 years 4 months ago
Bayesian Folding-In with Dirichlet Kernels for PLSI
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
Alexander Hinneburg, Hans-Henning Gabriel, Andr&eg...
PAKDD
2009
ACM
94views Data Mining» more  PAKDD 2009»
15 years 2 months ago
Item Preference Parameters from Grouped Ranking Observations
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...
Hideitsu Hino, Yu Fujimoto, Noboru Murata
IROS
2007
IEEE
119views Robotics» more  IROS 2007»
15 years 4 months ago
Scalable SLAM building conditionally independent local maps
— Local maps algorithms have demonstrated to be well suited for mapping large environments as can reduce the computational cost and improve the consistency of the final estimati...
Pedro Pinies, Juan D. Tardós
PVLDB
2010
158views more  PVLDB 2010»
14 years 8 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb