Sciweavers

365 search results - page 38 / 73
» Weight properties of network codes
Sort
View
ICANN
2009
Springer
14 years 3 months ago
Algorithms for Structural and Dynamical Polychronous Groups Detection
Polychronization has been proposed as a possible way to investigate the notion of cell assemblies and to understand their role as memory supports for information coding. In a spiki...
Régis Martinez, Hélène Paugam...
ICC
2008
IEEE
123views Communications» more  ICC 2008»
14 years 3 months ago
Downlink OFDM Scheduling and Resource Allocation for Delay Constraint SVC Streaming
Abstract—Efficient delivery of multimedia contents over wireless network is essential for future communication networks. However, content distribution and network engineering ar...
Xin Ji, Jianwei Huang, Mung Chiang, Francky Cattho...
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
14 years 10 months ago
On Signatures for Communication Graphs
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua...
WWW
2010
ACM
14 years 3 months ago
Dynamic and graphical web page breakpoints
Breakpoints are perhaps the quintessential feature of a debugger: they allow a developer to stop time and study the program state. Breakpoints are typically specified by selectin...
John J. Barton, Jan Odvarko
DSN
2006
IEEE
14 years 10 days ago
Efficient High Hamming Distance CRCs for Embedded Networks
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...
Justin Ray, Philip Koopman