453 search results - page 32 / 91 » On Approximation of Bookmark Assignments |
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
138
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
102
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
160
click to vote
DCG
2010
15 years 1 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...