282 search results - page 39 / 57 » Approximation algorithms for facility location problems |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
105
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
SIGMETRICS
2002
ACM
14 years 9 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...