Sciweavers

13621 search results - page 358 / 2725
» Computability and Complexity in Self-assembly
Sort
View
JC
2011
87views more  JC 2011»
15 years 1 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
TSP
2010
15 years 1 months ago
Low complexity equalization for doubly selective channels modeled by a basis expansion
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
Tomasz Hrycak, Saptarshi Das, Gerald Matz, Hans G....
FOCS
1997
IEEE
15 years 11 months ago
Making Nondeterminism Unambiguous
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
Klaus Reinhardt, Eric Allender

Publication
363views
14 years 5 months ago
Detecting and Discriminating Behavioural Anomalies
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempor...
Chen Change Loy, Tao Xiang, Shaogang Gong
COMPGEOM
2011
ACM
14 years 10 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber