Sciweavers

1871 search results - page 117 / 375
» The Ephemeral Pairing Problem
Sort
View
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 9 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
WIOPT
2010
IEEE
14 years 9 months ago
A contracts-based approach for spectrum sharing among cognitive radios
Abstract—Development of dynamic spectrum access and allocation techniques recently have made feasible the vision of cognitive radio systems. However, a fundamental question arise...
Dileep M. Kalathil, Rahul Jain
DATAMINE
2010
161views more  DATAMINE 2010»
14 years 8 months ago
Predicting labels for dyadic data
: In dyadic prediction, the input consists of a pair of items (a dyad), and the goal is to predict the value of an observation related to the dyad. Special cases of dyadic predicti...
Aditya Krishna Menon, Charles Elkan
PVLDB
2010
100views more  PVLDB 2010»
14 years 6 months ago
Efficient Proximity Detection among Mobile Users via Self-Tuning Policies
Given a set of users, their friend relationships, and a distance threshold per friend pair, the proximity detection problem is to find each pair of friends such that the Euclidean...
Man Lung Yiu, Leong Hou U, Simonas Saltenis, Kosta...
CVPR
2012
IEEE
13 years 1 months ago
An online learned CRF model for multi-target tracking
We introduce an online learning approach for multitarget tracking. Detection responses are gradually associated into tracklets in multiple levels to produce final tracks. Unlike ...
Bo Yang, Ram Nevatia