2104 search results - page 410 / 421 » Sorting with networks of data structures |
SIGMOD
2010
ACM
14 years 5 days ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
KIVS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. After introducing the concept of mobile agents and potential application domains, we motivate why mobile agent technology is an interesting concept for large Internet-bas...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
ESORICS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Online advertising has been suffering serious click fraud problem. Fraudulent publishers can generate false clicks using malicious scripts embedded in their web pages. Ev...