Sciweavers

2354 search results - page 59 / 471
» A Common-Sense Theory of Time
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
MIE
2008
128views Healthcare» more  MIE 2008»
13 years 9 months ago
Interface Terminologies: Bridging the Gap between Theory and Reality for Africa
In the United States and Europe, electronic health records (EHRs) allow information technology and decision-support to facilitate the activities of clinicians and are considered a...
Andrew S. Kanter, Amy Y. Wang, Fred E. Masarie Jr....
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 8 months ago
Channel Capacity Estimation using Free Probability Theory
—In many channel measurement applications, one needs to estimate some characteristics of the channels based on a limited set of measurements. This is mainly due to the highly tim...
Øyvind Ryan, Mérouane Debbah
TSP
2008
116views more  TSP 2008»
13 years 8 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
INFOCOM
2010
IEEE
13 years 6 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...