429 search results - page 25 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
JSS
2007
14 years 9 months ago
2007
Recently, the issue of Statistic Disclosure Control (SDC) has attracted much attention. SDC is a very important part of data security dealing with the protection of databases. Micr...
103
click to vote
SAT
2010
Springer
14 years 8 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
MP
2007
14 years 9 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...