Sciweavers

316 search results - page 26 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
NIPS
2007
13 years 9 months ago
The Generalized FITC Approximation
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
Andrew Naish-Guzman, Sean B. Holden
CORR
2012
Springer
227views Education» more  CORR 2012»
12 years 3 months ago
Trajectory and Policy Aware Sender Anonymity in Location Based Services
We consider Location-based Service (LBS) settings, where a LBS provider logs the requests sent by mobile device users over a period of time and later wants to publish/share these ...
Alin Deutsch, Richard Hull, Avinash Vyas, Kevin Ke...
NIPS
2007
13 years 9 months ago
Hierarchical Apprenticeship Learning with Application to Quadruped Locomotion
We consider apprenticeship learning—learning from expert demonstrations—in the setting of large, complex domains. Past work in apprenticeship learning requires that the expert...
J. Zico Kolter, Pieter Abbeel, Andrew Y. Ng
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 7 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat