Sciweavers

1716 search results - page 110 / 344
» Proving Conditional Termination
Sort
View
ICASSP
2009
IEEE
15 years 7 months ago
A simple, efficient and near optimal algorithm for compressed sensing
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
Thomas Blumensath, Mike E. Davies
115
Voted
CAISE
2003
Springer
15 years 6 months ago
Multivalued Dependencies and a 4NF for XML
In this paper we make three main contributions. We firstly define multivalued dependencies in XML (XMVDs) and show that they generalize the definition of a functional dependenc...
Millist W. Vincent, Jixue Liu
90
Voted
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 26 days ago
Network-based consensus averaging with general noisy channels
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
Ram Rajagopal, Martin J. Wainwright
104
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 7 months ago
On the regularity of iterated hairpin completion of a single word
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
190
Voted
POPL
2007
ACM
16 years 1 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...