Sciweavers

1732 search results - page 205 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
APAL
2010
85views more  APAL 2010»
15 years 6 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
NAR
1998
73views more  NAR 1998»
15 years 6 months ago
Identification and characterization of the RAD51 gene from the ciliate Tetrahymena thermophila
The RAD51 gene is a eukaryotic homolog of recA, a critical component in homologous recombination and DNA repair pathways in Escherichia coli. We have cloned the RAD51 homolog from...
Colin Campbell, Daniel P. Romero
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 6 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
IANDC
2007
107views more  IANDC 2007»
15 years 6 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
ICA
2012
Springer
14 years 2 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...