Sciweavers

2025 search results - page 96 / 405
» On the Utility of Inference Mechanisms
Sort
View
CN
2007
148views more  CN 2007»
13 years 9 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
AAAI
2011
12 years 9 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
ICML
2009
IEEE
14 years 10 months ago
MedLDA: maximum margin supervised topic models for regression and classification
Supervised topic models utilize document's side information for discovering predictive low dimensional representations of documents; and existing models apply likelihoodbased...
Jun Zhu, Amr Ahmed, Eric P. Xing
ICDIM
2007
IEEE
14 years 3 months ago
Exploiting multi-evidence from multiple user's interests to personalizing information retrieval
The goal of personalization in information retrieval is to tailor the search engine results to the specific goals, preferences and general interests of the users. We propose a no...
Lynda Tamine-Lechani, Mohand Boughanem, Nesrine Ze...
IJAR
2010
98views more  IJAR 2010»
13 years 6 months ago
Variable elimination for influence diagrams with super value nodes
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. Tatman and Shachter (1990), introduced the possibility of having super-valu...
Manuel Luque, Francisco Javier Díez