Sciweavers

216 search results - page 30 / 44
» Covering Problems with Hard Capacities
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 4 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
FOCS
2004
IEEE
13 years 11 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
IROS
2007
IEEE
179views Robotics» more  IROS 2007»
14 years 1 months ago
Stereo-based 6D object localization for grasping with humanoid robot systems
Abstract— Robust vision-based grasping is still a hard problem for humanoid robot systems. When being restricted to using the camera system built-in into the robot’s head for o...
Pedram Azad, Tamim Asfour, Rüdiger Dillmann
ICWL
2004
Springer
14 years 27 days ago
CUBES: Providing Flexible Learning Environment for Virtual Universities
Abstract. To enable an online virtual university, a learning environment covering the entire spectrum of the learning and management process is required. However, constructing such...
Peifeng Xiang, Yuanchun Shi, Weijun Qin, Xin Xiang
ICCSA
2003
Springer
14 years 22 days ago
Robust Speaker Recognition Against Utterance Variations
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
JongJoo Lee, JaeYeol Rheem, Ki Yong Lee