692 search results - page 139 / 139 » BDD minimization for approximate computing |
WWW
2011
ACM
13 years 21 days ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
ALGORITHMICA
2011
13 years 24 days ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...