158
click to vote
AAAI
2012
13 years 6 months ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
146
click to vote
AAAI
2012
13 years 6 months ago
2012
Current computer involvement in adolescent social networks (youth between the ages of 11 and 17) provides new opportunities to study group dynamics, interactions amongst peers, an...
140
click to vote
AAAI
2012
13 years 6 months ago
2012
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
127
click to vote
AAAI
2012
2012
Automatic Targetless Extrinsic Calibration of a 3D Lidar and Camera by Maximizing Mutual Information
13 years 6 months ago
This paper reports on a mutual information (MI) based algorithm for automatic extrinsic calibration of a 3D laser scanner and optical camera system. By using MI as the registratio...
156
click to vote
AAAI
2012
13 years 6 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
230
click to vote
AAAI
2012
13 years 6 months ago
2012
Peer prediction mechanisms allow the truthful elicitation of private signals (e.g., experiences, or opinions) in regard to a true world state when this ground truth is unobservabl...
134
click to vote
AAAI
2012
13 years 6 months ago
2012
We consider the problem of designing automated strategies for interactions with human subjects, where the humans must be rewarded for performing certain tasks of interest. We focu...
189
click to vote
AAAI
2012
13 years 6 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
132
click to vote
AAAI
2012
13 years 6 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...