Sciweavers

453 search results - page 30 / 91
» On Approximation of Bookmark Assignments
Sort
View
MST
2010
140views more  MST 2010»
13 years 7 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
ICASSP
2011
IEEE
13 years 15 days ago
An approximate Minimum MOSPA estimator
Optimizing over a variant of the Mean Optimal Subpattern Assignment (MOSPA) metric is equivalent to optimizing over the track accuracy statistic often used in target tracking benc...
David Frederic Crouse, Peter Willett, Marco Guerri...
INFOCOM
2009
IEEE
14 years 3 months ago
Emulation and Approximation of a Flexible Delay Line by Parallel Non-Overtaking Delay Lines
—In this paper we propose to construct an flexible delay line with maximum delay d by parallel non-overtaking delay lines. We show that for a fixed number of non-overtaking del...
Duan-Shin Lee, Kai-Jie Hsu, Cheng-Shang Chang, Jay...
HOTOS
2007
IEEE
14 years 19 days ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 3 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...