15485 search results - page 115 / 3097 » Computing Optimal Subsets |
WAIM
2010
Springer
14 years 7 months ago
2010
Springer
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
CP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
IWINAC
2007
Springer
15 years 4 months ago
2007
Springer
The computer model of visual attention derives an interest or saliency map from an input image in a process that encompasses several data combination steps. While several combinati...
GLOBECOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— We consider a set of computer resources used by a service provider to host enterprise applications subject to service level agreements. We present an approach for resource opti...