Sciweavers

3044 search results - page 181 / 609
» Linear logical approximations
Sort
View
212
Voted
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 6 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SMI
2005
IEEE
138views Image Analysis» more  SMI 2005»
15 years 9 months ago
An Accurate Error Measure for Adaptive Subdivision Surfaces
A tight estimate on the maximum distance between a subdivision surface and its linear approximation is introduced to guide adaptive subdivision with guaranteed accuracy.
Xiaobin Wu, Jörg Peters
128
Voted
TOC
2008
95views more  TOC 2008»
15 years 3 months ago
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
15 years 10 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
252
Voted
ICLP
2009
Springer
16 years 4 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin