Sciweavers

62 search results - page 7 / 13
» Modified bar recursion
Sort
View
DCC
2008
IEEE
14 years 9 months ago
Sublinear Recovery of Sparse Wavelet Signals
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
Ray Maleh, Anna C. Gilbert
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 4 months ago
Low Complexity Adaptive Turbo Frequency-Domain Channel Estimation for Single-Carrier Multi-User Detection with Unknown Co-Channe
—Adaptive Turbo frequency-domain channel estimation is investigated for single-carrier (SC) multi-user detection in the presence of unknown co-channel interference (CCI). We prop...
Ye Wu, Xu Zhu, Asoke K. Nandi
SAIG
2001
Springer
14 years 2 months ago
A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming
A characteristic of aspect-oriented programming, as embodied in AspectJ, is the use of advice to incrementally modify the behavior of a program. An advice declaration specifies a...
Mitchell Wand
LICS
1994
IEEE
14 years 1 months ago
Efficient Inference of Object Types
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another obj...
Jens Palsberg
CPC
2006
93views more  CPC 2006»
13 years 9 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang