Sciweavers

CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 4 months ago
The Binary-Symmetric Parallel-Relay Network
We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, wh...
Lawrence Ong, Sarah J. Johnson, Christopher M. Kel...
AUTOMATICA
2004
77views more  AUTOMATICA 2004»
13 years 4 months ago
Non-asymptotic quality assessment of generalised FIR models with periodic inputs
In any real-life identification problem, only a finite number of data points is available. On the other hand, almost all results in stochastic identification pertain to asymptotic...
Marco C. Campi, Su Ki Ooi, Erik Weyer
TSP
2008
166views more  TSP 2008»
13 years 4 months ago
Nonuniform Sampling of Periodic Bandlimited Signals
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
E. Margolis, Yonina C. Eldar
SIAMAM
2008
89views more  SIAMAM 2008»
13 years 4 months ago
An Interaction Theory for Scattering by Defects in Arrays
Wave scattering by an array of bodies that is periodic except for a finite number of missing or irregular elements is considered. The field is decomposed into contributions from a...
I. Thompson, C. M. Linton
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 5 months ago
Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
Vincent Yan Fu Tan, Vivek K. Goyal
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 5 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...
CCCG
2006
13 years 6 months ago
Polygons Flip Finitely: Flaws and a Fix
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, ...
DEXA
2008
Springer
123views Database» more  DEXA 2008»
13 years 6 months ago
Evolutionary Clustering in Description Logics: Controlling Concept Formation and Drift in Ontologies
Abstract. We present a method based on clustering techniques to detect concept drift or novelty in a knowledge base expressed in Description Logics. The method exploits an effectiv...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
ADG
2006
Springer
220views Mathematics» more  ADG 2006»
13 years 11 months ago
Cylinders Through Five Points: Complex and Real Enumerative Geometry
It is known that five points in 3 generically determine a finite number of cylinders containing those points. We discuss ways in which it can be shown that the generic (complex) nu...
Daniel Lichtblau
ICCV
2005
IEEE
14 years 6 months ago
Non-Parametric Self-Calibration
In this paper we develop a theory of non-parametric self-calibration. Recently, schemes have been devised for non-parametric laboratory calibration, but not for selfcalibration. W...
David Nistér, Henrik Stewénius, Etie...