8437 search results - page 535 / 1688 » Preferences over Sets |
180
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
153
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Robotics researchers are often faced with realtime constraints, and for that reason algorithmic and implementation-level optimization can dramatically increase the over...
167
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
187
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— We are interested in transferring control policies for arbitrary tasks from a human to a robot. Using interactive demonstration via teloperation as our transfer scenario, we ca...
186
Voted
AAIM
2008
Springer
16 years 1 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...