Sciweavers

357 search results - page 43 / 72
» Algorithms for the coalitional manipulation problem
Sort
View
AI
2000
Springer
15 years 7 days ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 2 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
CVPR
2008
IEEE
16 years 2 months ago
Graph-shifts: Natural image labeling by dynamic hierarchical computing
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
Jason J. Corso, Alan L. Yuille, Zhuowen Tu
83
Voted
ICDCSW
2007
IEEE
15 years 6 months ago
Building Trust in Online Rating Systems Through Signal Modeling
Abstract— Online feedback-based rating systems are gaining popularity. Dealing with unfair ratings in such systems has been recognized as an important but difficult problem. Thi...
Yafei Yang, Yan Lindsay Sun, Jin Ren, Qing Yang
96
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...