Sciweavers

523 search results - page 19 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 6 months ago
Maximum-Likelihood Decoding and Performance Analysis of a Noisy Channel Network with Network Coding
Abstract— We investigate sink decoding methods and performance analysis approaches for a network with intermediate node encoding (coded network). The network consists of statisti...
Ming Xiao, Tor M. Aulin
COMPGEOM
2010
ACM
15 years 4 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
GLOBECOM
2009
IEEE
15 years 6 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
FOCM
2010
140views more  FOCM 2010»
14 years 10 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
RTAS
2006
IEEE
15 years 5 months ago
Switch Scheduling and Network Design for Real-Time Systems
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
Sathish Gopalakrishnan, Marco Caccamo, Lui Sha