Sciweavers

260 search results - page 33 / 52
» Trading Probability for Fairness
Sort
View
157
Voted
TWC
2008
225views more  TWC 2008»
15 years 3 months ago
Joint rate and power allocation for cognitive radios in dynamic spectrum access environment
Abstract--We investigate the dynamic spectrum sharing problem among primary and secondary users in a cognitive radio network. We consider the scenario where primary users exhibit o...
Dong In Kim, Long Le, Ekram Hossain
350
Voted
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 4 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
124
Voted
SIGSOFT
2005
ACM
16 years 4 months ago
Arithmetic program paths
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
Manos Renieris, Shashank Ramaprasad, Steven P. Rei...
130
Voted
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 3 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
142
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Encounter-Based Routing in DTNs
—Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network...
Samuel C. Nelson, Mehedi Bakht, Robin Kravets