26 search results - page 5 / 6 » Minimum Common String Partition Problem: Hardness and Approx... |
210
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
138
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
172
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
162
Voted
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
262
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...