3495 search results - page 643 / 699 » On the random satisfiable process |
VLSID
2001
IEEE
16 years 7 days ago
2001
IEEE
Networking hardware manufacturers face the dual demands of supporting ever increasing bandwidth requirements, while also delivering new features, such as the ability to implement ...
STOC
2007
ACM
16 years 5 days 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...
171
click to vote
SIGMOD
2009
ACM
16 years 3 days ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
EUROSYS
2006
ACM
15 years 9 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
WSDM
2009
ACM
15 years 6 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...