147 search results - page 28 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— High-speed wireless communication technology (e.g. WiMAX) makes it feasible and cost-effective to build wireless back-hauls for Internet access. Compared to wired count...
CCS
2003
ACM
15 years 2 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
111
click to vote
SASO
2007
IEEE
15 years 3 months ago
2007
IEEE
A fundamental problem that confronts decentralized reputation systems is the design of efficient, secure and incentive-compatible mechanisms to gather trust information despite m...
GRID
2006
Springer
14 years 9 months ago
2006
Springer
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
94
Voted
MOBICOM
2003
ACM
15 years 2 months ago
2003
ACM
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...