Sciweavers

1019 search results - page 2 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
CIE
2009
Springer
13 years 11 months ago
On Generating Independent Random Strings
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
Marius Zimand
IDA
2009
Springer
13 years 2 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis
ASPDAC
2008
ACM
94views Hardware» more  ASPDAC 2008»
13 years 7 months ago
Robust on-chip bus architecture synthesis for MPSoCs under random tasks arrival
A major trend in a modern system-on-chip design is a growing system complexity, which results in a sharp increase of communication traffic on the on-chip communication bus architec...
Sujan Pandey, Rolf Drechsler
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
13 years 10 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
IWANN
2005
Springer
13 years 10 months ago
Robust Blind Image Watermarking with Independent Component Analysis: A Embedding Algorithm
Abstract. The authors propose a new solution to the blind robust watermarking of digital images. In this approach we embed the watermark into the independent components of the imag...
Juan José Murillo-Fuentes, Rafael Boloix-To...