563 search results - page 62 / 113 » Computing approximate PSD factorizations |
CCCG
2006
13 years 11 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
EOR
2010
13 years 7 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
HAPTICS
2006
IEEE
14 years 4 months ago
2006
IEEE
A central element of surgical simulators is the generation of appropriate haptic feedback. Several factors influence this rendering process, which could potentially degrade the f...