4843 search results - page 270 / 969 » The Shortcut Problem - Complexity and Approximation |
151
Voted
CLUSTER
2001
IEEE
15 years 7 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
140
click to vote
MTA
2000
15 years 3 months ago
2000
Object-level image retrieval is an active area of research. Given an image, a human observerdoesnot see randomdots of colors. Rather,he she observesfamiliarobjectsin the image. The...
139
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
146
Voted
ANOR
2004
15 years 3 months ago
2004
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
119
Voted
IPCCC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...