Sciweavers

2496 search results - page 219 / 500
» On covering by translates of a set
Sort
View
IPL
2008
80views more  IPL 2008»
15 years 6 months ago
Path partitions of hypercubes
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
Petr Gregor, Tomás Dvorák
BCB
2010
161views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
JDCTA
2010
228views more  JDCTA 2010»
15 years 1 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
LPNMR
2001
Springer
15 years 11 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
ICIP
2006
IEEE
16 years 8 months ago
A Probabilistic Approach to Robust Shape Matching
We present a probabilistic approach to shape matching which is invariant to rotation, translation and scaling. Shapes are represented by unlabeled point sets, so discontinuous bou...
Graham McNeill, Sethu Vijayakumar