Sciweavers

2479 search results - page 307 / 496
» Random Event Structures
Sort
View
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 2 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
111
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Optimum Network Coding for Delay Sensitive Applications in WiMAX Unicast
—MAC layer random network coding (MRNC) was proposed in [1] as an alternative to HARQ for reliable data transmission in WiMAX unicast. It has been shown that MRNC achieves a high...
Amin Alamdar Yazdi, Sameh Sorour, Shahrokh Valaee,...
113
Voted
MICRO
2009
IEEE
137views Hardware» more  MICRO 2009»
15 years 9 months ago
ESKIMO: Energy savings using Semantic Knowledge of Inconsequential Memory Occupancy for DRAM subsystem
Dynamic Random Access Memory (DRAM) is used as the bulk of the main memory in most computing systems and its energy and power consumption has become a first-class design considera...
Ciji Isen, Lizy Kurian John
CEC
2008
IEEE
15 years 9 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
131
Voted
ICC
2008
IEEE
15 years 9 months ago
Repeat Accumulate code Division Multiple Access and its Hybrid Detection
— In this paper, we propose the novel concept of Repeat Accumulate Code Division Multiple Access (RA-CDMA), which employs unique, user-specific channel code generator matrices (...
Rong Zhang, Lei Xu, Sheng Chen, Lajos Hanzo