Sciweavers

6610 search results - page 1270 / 1322
» Community Structures of Networks
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 2 months ago
Connectivity oracles for failure prone graphs
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...
Ran Duan, Seth Pettie
CQRE
1999
Springer
14 years 2 months ago
Electronic Payments: Where Do We Go from Here?
Currently, the Internet and the World Wide Web on-line business is booming, with traffic, advertising and content growing at sustained exponential rates. However, the full potentia...
Markus Jakobsson, David M'Raïhi, Yiannis Tsio...
KIVS
1999
Springer
14 years 2 months ago
Mobile Agents as an Architectural Concept for Internet-Based Distributed Applications - The WASP Project Approach
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...
Stefan Fünfrocken, Friedemann Mattern
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 2 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
PODC
2010
ACM
14 years 1 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
« Prev « First page 1270 / 1322 Last » Next »