3898 search results - page 424 / 780 » On the Bit Extraction Problem |
172
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
153
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
133
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
130
click to vote
MICRO
2008
IEEE
15 years 11 months ago
2008
IEEE
Hardware signatures have been recently proposed as an efficient mechanism to detect conflicts amongst concurrently running transactions in transactional memory systems (e.g., Bulk...
137
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...