Sciweavers

2925 search results - page 74 / 585
» Information Complexity of Online Problems
Sort
View
ICASSP
2011
IEEE
14 years 9 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
16 years 12 days ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
AIED
2005
Springer
15 years 11 months ago
Automatic and Semi-Automatic Skill Coding With a View Towards Supporting On-Line Assessment
This paper explores the problem of automatic and semi-automatic coding of on-line test items with a skill coding that allows the assessment to occur at a level that is both indicat...
Carolyn Penstein Rosé, Pinar Donmez, Gahgen...
ECCV
2010
Springer
15 years 8 months ago
Inter-Camera Association of Multi-Target Tracks by On-line Learned Appearance Affinity Models
We propose a novel system for associating multi-target tracks across multiple non-overlapping cameras by an on-line learned discriminative appearance affinity model. Collecting rel...
SAC
2009
ACM
16 years 27 days ago
Defending online reputation systems against collaborative unfair raters through signal modeling and trust
Online feedback-based rating systems are gaining popularity. Dealing with collaborative unfair ratings in such systems has been recognized as an important but difficult problem. T...
Yafei Yang, Yan Lindsay Sun, Steven Kay, Qing Yang