Sciweavers

291 search results - page 47 / 59
» The Bidimensionality Theory and Its Algorithmic Applications
Sort
View
WWW
2005
ACM
14 years 9 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
CIKM
2009
Springer
14 years 3 months ago
Predicting the volume of comments on online news stories
On-line news agents provide commenting facilities for readers to express their views with regard to news stories. The number of user supplied comments on a news article may be ind...
Manos Tsagkias, Wouter Weerkamp, Maarten de Rijke
ECTEL
2007
Springer
14 years 2 months ago
Using MotSaRT to Support On-Line Teachers in Student Motivation
Motivation to learn is affected by a student’s self-efficacy, goal orientation, locus of control and perceived task difficulty. In the classroom, teachers know how to motivate th...
Teresa Hurley, Stephan Weibelzahl
ATAL
2008
Springer
13 years 10 months ago
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
Matthijs T. J. Spaan, Francisco S. Melo