5214 search results - page 344 / 1043 » The Online Specialization Problem |
145
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
193
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
243
click to vote
WSC
2004
15 years 8 months ago
2004
We consider the problem of estimating the small probability that a function of a finite number of random variables exceeds a large threshold. Each input random variable may be lig...
194
click to vote
ICDE
2010
IEEE
15 years 7 months ago
2010
IEEE
— We are currently witnessing an increasing interest in the use of the web as an information and knowledge source. Much of the information sought after in the web is in this case...
173
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...