Sciweavers

2434 search results - page 210 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
143
Voted
GCB
2010
Springer
182views Biometrics» more  GCB 2010»
15 years 2 months ago
Repeat-aware Comparative Genome Assembly
: The current high-throughput sequencing technologies produce gigabytes of data even when prokaryotic genomes are processed. In a subsequent assembly phase, the generated overlappi...
Peter Husemann, Jens Stoye
ICIP
2002
IEEE
16 years 5 months ago
Visualization of high dynamic range images
A novel paradigm for information visualization in high dynamic range images is presented in this paper. These images, real or synthetic, have luminance with typical ranges many or...
Alvaro Pardo, Guillermo Sapiro
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 9 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 9 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
15 years 9 months ago
Using transposition for pattern discovery from microarray data
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
François Rioult, Jean-François Bouli...