Sciweavers

739 search results - page 98 / 148
» New Games Related to Old and New Sequences
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 2 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
ICASSP
2011
IEEE
12 years 11 months ago
An atlas-based deep brain structure segmentation method: from coarse positioning to fine shaping
Segmentation of deep brain structures is a challenging task for MRI images due to blurry structure boundaries, small object size and irregular shapes. In this paper, we present a ...
Yishan Luo, Albert C. S. Chung
APBC
2004
13 years 9 months ago
EMAGEN: An Efficient Approach to Multiple Whole Genome Alignment
Following advances in biotechnology, many new whole genome sequences are becoming available every year. A lot of useful information can be derived from the alignment and compariso...
Jitender S. Deogun, Jingyi Yang, Fangrui Ma
ICPR
2000
IEEE
14 years 8 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 8 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström