Sciweavers

1439 search results - page 48 / 288
» Fast approximation of centrality
Sort
View
TWC
2010
13 years 5 months ago
On the statistics of cognitive radio capacity in shadowing and fast fading environments
Abstract--In this paper we consider the capacity of the cognitive radio (CR) channel in a fading environment under a "low interference regime". This capacity depends crit...
Muhammad Fainan Hanif, Peter J. Smith
INFOCOM
1999
IEEE
14 years 3 months ago
Matching Output Queueing with a Combined Input Output Queued Switch
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaj...
SDM
2007
SIAM
131views Data Mining» more  SDM 2007»
14 years 12 days ago
Load Shedding in Classifying Multi-Source Streaming Data: A Bayes Risk Approach
In many applications, we monitor data obtained from multiple streaming sources for collective decision making. The task presents several challenges. First, data in sensor networks...
Yijian Bai, Haixun Wang, Carlo Zaniolo
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 11 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 11 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...