Sciweavers

972 search results - page 19 / 195
» Performance of data networks with random links
Sort
View
IAJIT
2010
193views more  IAJIT 2010»
14 years 10 months ago
Performance of OCDMA Systems Using Random Diagonal Code for Different Decoders Architecture Schemes
: In this paper, new code families are constructed for spectral-amplitude coding optical code division multiple access, called random diagonal code for spectral amplitude coding op...
Hilal Adnan Fadhil, Syed Alwee Aljunid, Badlished ...
GRID
2004
Springer
15 years 5 months ago
High Performance Threaded Data Streaming for Large Scale Simulations
We have developed a threaded parallel data streaming approach using Logistical Networking (LN) to transfer multi-terabyte simulation data from computers at NERSC to our local anal...
Viraj Bhat, Scott Klasky, Scott Atchley, Micah Bec...
ICML
2004
IEEE
16 years 16 days ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
INFOCOM
2003
IEEE
15 years 5 months ago
User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
Sem C. Borst
NSDI
2010
15 years 1 months ago
Cheap and Large CAMs for High Performance Data-Intensive Networked Systems
We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. These are targeted at emerging data-intensive networked systems that require mas...
Ashok Anand, Chitra Muthukrishnan, Steven Kappes, ...