Sciweavers

2434 search results - page 436 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
121
Voted
CANDC
2006
ACM
15 years 15 days ago
Dealing with repetitions in sequencing by hybridization
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
Jacek Blazewicz, Fred Glover, Marta Kasprzak, Wojc...
JCB
2006
123views more  JCB 2006»
15 years 13 days ago
Reconstructing Ancestral Haplotypes with a Dictionary Model
We propose a dictionary model for haplotypes. According to the model, a haplotype is constructed by randomly concatenating haplotype segments from a given dictionary of segments. ...
Kristin L. Ayers, Chiara Sabatti, Kenneth Lange
121
Voted
JSA
2007
191views more  JSA 2007»
15 years 10 days ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
IS
2010
14 years 11 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 7 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu