14161 search results - page 322 / 2833 » On generalized middle-level problem |
201
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
184
click to vote
WEA
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
187
Voted
ESA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
183
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
166
click to vote
TIT
2008
15 years 6 months 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 ...