500 search results - page 59 / 100 » Approximation algorithms for maximum independent set of pseu... |
110
click to vote
IJON
2008
15 years 1 months ago
2008
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
111
Voted
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
114
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
101
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
151
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...