Sciweavers

1046 search results - page 151 / 210
» Approximation Algorithms for Domination Search
Sort
View
TALG
2010
158views more  TALG 2010»
14 years 10 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
AIRWEB
2008
Springer
15 years 5 months ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 4 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
WWW
2008
ACM
16 years 4 months ago
Web graph similarity for anomaly detection (poster)
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
Panagiotis Papadimitriou 0002, Ali Dasdan, Hector ...
WAOA
2004
Springer
85views Algorithms» more  WAOA 2004»
15 years 8 months ago
A PTAS for Delay Minimization in Establishing Wireless Conference Calls
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...
Leah Epstein, Asaf Levin