Sciweavers

1022 search results - page 49 / 205
» Logspace Complexity of Functions and Structures
Sort
View
ICCS
2004
Springer
14 years 3 months ago
Towards a Generalised Runtime Environment for Parallel Haskells
Abstract. Implementations of parallel dialects (or: coordination languages) on a functional base (or: computation) language always have to extend complex runtime environments by th...
Jost Berthold
ISCAS
2003
IEEE
172views Hardware» more  ISCAS 2003»
14 years 3 months ago
Efficient symbol synchronization techniques using variable FIR or IIR interpolation filters
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
Martin Makundi, Timo I. Laakso
RSA
2008
85views more  RSA 2008»
13 years 9 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham
NAR
2011
214views Computer Vision» more  NAR 2011»
13 years 16 days ago
IEDB-3D: structural data within the immune epitope database
IEDB-3D is the 3D structural component of the Immune Epitope Database (IEDB) available via the ‘Browse by 3D Structure’ page at http://www.iedb .org. IEDB-3D catalogs B- and T...
Julia V. Ponomarenko, Nikitas Papangelopoulos, Dir...
ICA
2012
Springer
12 years 5 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...