14165 search results - page 640 / 2833 » The generalized two-server problem |
186
click to vote
ALGORITHMICA
2007
15 years 7 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
166
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
175
click to vote
AI
2006
Springer
15 years 7 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
204
click to vote
ISCI
2008
15 years 7 months ago
2008
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has...
211
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...