Sciweavers

695 search results - page 71 / 139
» The structure of intrinsic complexity of learning
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
OSDI
2008
ACM
14 years 8 months ago
An Internet Protocol Address Clustering Algorithm
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
Robert Beverly, Karen R. Sollins
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 6 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
SIGIR
2012
ACM
11 years 10 months ago
TFMAP: optimizing MAP for top-n context-aware recommendation
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...
Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, ...
PREMI
2005
Springer
14 years 1 months ago
Eliciting Domain Knowledge in Handwritten Digit Recognition
Pattern recognition methods for complex structured objects such as handwritten characters often have to deal with vast search spaces. Developed techniques, despite significant adv...
Tuan Trung Nguyen