172 search results - page 29 / 35 » The Analysis of a List-Coloring Algorithm on a Random Graph |
166
Voted
CONSTRAINTS
1998
15 years 2 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
143
Voted
PODC
2004
ACM
15 years 8 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
131
Voted
WWW
2010
ACM
15 years 9 months ago
2010
ACM
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
137
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
140
Voted
ACSAC
2010
IEEE
14 years 6 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...