2434 search results - page 257 / 487 » Algorithmic Randomness of Closed Sets |
196
click to vote
EDBT
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
162
click to vote
FOCS
2009
IEEE
16 years 1 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...
185
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
188
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
180
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
A simple algorithm is described that computes the radiometric responsefunction of an imaging system,from images of an arbitrar), scene taken using different exposures. The exposur...