Sciweavers

140 search results - page 5 / 28
» String Quartets In Binary
Sort
View
COCOON
2010
Springer
13 years 11 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
IPL
1998
95views more  IPL 1998»
13 years 7 months ago
A Variation on the Zero-One Law
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
CCA
2005
Springer
13 years 9 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
ISMIR
2005
Springer
189views Music» more  ISMIR 2005»
14 years 1 months ago
Instrument Identification in Polyphonic Music: Feature Weighting with Mixed Sounds, Pitch-Dependent Timbre Modeling, and Use of
This paper addresses the problem of identifying musical instruments in polyphonic music. Musical instrument identification (MII) is an improtant task in music information retriev...
Tetsuro Kitahara, Masataka Goto, Kazunori Komatani...
DAGSTUHL
2006
13 years 9 months ago
Binary Lambda Calculus and Combinatory Logic
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
John Tromp