Sciweavers

8298 search results - page 1470 / 1660
» On the Complexity of Numerical Analysis
Sort
View
PODC
2005
ACM
16 years 4 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
PODC
2005
ACM
16 years 4 days ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
16 years 4 days ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
ICFEM
2005
Springer
16 years 2 days ago
A Compositional Framework for Service Interaction Patterns and Interaction Flows
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their composition into complex service-based business process int...
Alistair P. Barros, Egon Börger
VIZSEC
2005
Springer
16 years 1 days ago
A User-centered Look at Glyph-based Security Visualization
This paper presents the Intrusion Detection toolkit (IDtk), an information Visualization tool for intrusion detection (ID). IDtk was developed through a user-centered design proce...
Anita Komlodi, Penny Rheingans, Utkarsha Ayachit, ...
« Prev « First page 1470 / 1660 Last » Next »