Sciweavers

46 search results - page 9 / 10
» On k-partitioning of Hamming Graphs
Sort
View
CSCLP
2004
Springer
14 years 3 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
ECCC
2010
89views more  ECCC 2010»
13 years 10 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
COMBINATORICS
2000
100views more  COMBINATORICS 2000»
13 years 9 months ago
Separability Number and Schurity Number of Coherent Configurations
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
Sergei Evdokimov, Ilia N. Ponomarenko
ISMIR
2004
Springer
124views Music» more  ISMIR 2004»
14 years 3 months ago
A Comparison of Rhythmic Similarity Measures
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
Godfried T. Toussaint
BMCBI
2008
122views more  BMCBI 2008»
13 years 10 months ago
High-throughput bioinformatics with the Cyrille2 pipeline system
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
Mark W. E. J. Fiers, Ate van der Burgt, Erwin Date...