14518 search results - page 207 / 2904 » Two Problems for Sophistication |
96
Voted
COLT
1997
Springer
15 years 4 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
TCS
2008
15 years 18 days ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
93
Voted
JASIS
1998
15 years 11 days ago
1998
This article develops a theoretical framework of distributed representations to explore the representational properties in group problem solving. The basic principle of distribute...
97
Voted
TIT
2008
15 years 18 days ago
2008
Abstract--We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0 : PXY against H1 : PXPY ...
112
Voted
CPM
2000
Springer
15 years 5 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...