2434 search results - page 249 / 487 » Algorithmic Randomness of Closed Sets |
129
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
—In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consu...
151
click to vote
MST
2010
15 years 2 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
162
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
177
click to vote
CORR
2012
Springer
13 years 12 months ago
2012
Springer
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
146
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...