Sciweavers

780 search results - page 67 / 156
» Cost-Sharing Approximations for h
Sort
View
FSTTCS
2009
Springer
15 years 5 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...
SCALESPACE
2009
Springer
15 years 5 months ago
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
Jan Lellmann, Jörg H. Kappes, Jing Yuan, Flor...
RECSYS
2009
ACM
15 years 5 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
ICRA
2008
IEEE
169views Robotics» more  ICRA 2008»
15 years 5 months ago
Sparse incremental learning for interactive robot control policy estimation
— 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...
Daniel H. Grollman, Odest Chadwicke Jenkins
ISAAC
2007
Springer
93views Algorithms» more  ISAAC 2007»
15 years 5 months ago
Dilation-Optimal Edge Deletion in Polygonal Cycles
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Mi...