14165 search results - page 693 / 2833 » The generalized two-server problem |
201
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
174
Voted
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
169
Voted
TSP
2008
15 years 7 months ago
2008
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant" space, wh...
208
click to vote
COMCOM
2000
15 years 7 months ago
2000
As the popularity of the World Wide Web increases, the amount of traffic results in major congestion problems for the retrieval of data over wide distances. To react to this, user...
175
click to vote
ENTCS
2002
15 years 7 months ago
2002
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...