5138 search results - page 935 / 1028 » Randomized Algorithms for 3-SAT |
109
Voted
STOC
2007
ACM
16 years 2 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...
115
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
116
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
211
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
104
Voted
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...