14158 search results - page 325 / 2832 » Generalized switch-setting problems |
149
click to vote
WEA
2005
Springer
15 years 10 months 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...
149
click to vote
ESA
2001
Springer
15 years 9 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...
142
click to vote
COLT
1999
Springer
15 years 8 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...
128
click to vote
TIT
2008
15 years 4 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 ...
230
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...