Sciweavers

903 search results - page 160 / 181
» On the reduction of a random basis
Sort
View
ICFP
2003
ACM
15 years 10 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
EDBTW
2010
Springer
15 years 5 months ago
Key escrow schemes with sliding window for privacy-aware anomaly detection system
Requirements for a traffic monitoring system can be very demanding as both privacy and performance aspects have to be taken into account jointly. Moreover, the legislation sets fo...
Esa Hyytiä, Ivan Gojmerac, Simone Teofili, Gi...
93
Voted
GLOBECOM
2009
IEEE
15 years 4 months ago
Sparse Decoding of Low Density Parity Check Codes Using Margin Propagation
—One of the key factors underlying the popularity of Low-density parity-check (LDPC) code is its iterative decoding algorithm that is amenable to efficient hardware implementati...
Ming Gu, Kiran Misra, Hayder Radha, Shantanu Chakr...
82
Voted
SUTC
2008
IEEE
15 years 4 months ago
Using Body Sensor Networks for Increased Safety in Bomb Disposal Missions
Bomb disposal manned missions are inherently safetycritical. Wireless Sensor Network (WSN) technology potentially offers an opportunity to increase the safety of the operatives in...
John Kemp, Elena I. Gaura, James Brusey, C. Dougla...
79
Voted
CODES
2007
IEEE
15 years 4 months ago
Channel trees: reducing latency by sharing time slots in time-multiplexed networks on chip
Networks on Chip (NoC) have emerged as the design paradigm for scalable System on Chip communication infrastructure. A growing number of applications, often with firm (FRT) or so...
Andreas Hansson, Martijn Coenen, Kees Goossens