4908 search results - page 671 / 982 » On the Complexity of Optimal K-Anonymity |
168
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
138
click to vote
BC
2007
15 years 6 months ago
2007
We introduce a new illusion that contradicts common assumptions in the field of visual motion perception. When an unoccluded bar moves at certain speeds and oscillates at certain ...
139
click to vote
COMCOM
2010
15 years 6 months ago
2010
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix = (ij),...
208
Voted
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
111
click to vote
DM
2008
15 years 6 months ago
2008
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...