296 search results - page 58 / 60 » Approximate Discovery of Random Graphs |
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
INFOCOM
1998
IEEE
13 years 10 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
SIAMJO
2002
13 years 5 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
WWW
2007
ACM
14 years 7 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...