Sciweavers

25 search results - page 5 / 5
» Better Approximations for the Minimum Common Integer Partiti...
Sort
View
RECOMB
2007
Springer
14 years 6 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
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...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
FOCS
2003
IEEE
13 years 11 months ago
Always Good Turing: Asymptotically Optimal Probability Estimation
While deciphering the Enigma Code during World War II, I.J. Good and A.M. Turing considered the problem of estimating a probability distribution from a sample of data. They derive...
Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 10 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
TKDE
2011
234views more  TKDE 2011»
13 years 1 months ago
The World in a Nutshell: Concise Range Queries
—With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PD...
Ke Yi, Xiang Lian, Feifei Li, Lei Chen 0002
TWC
2010
13 years 26 days ago
Optimized opportunistic multicast scheduling (OMS) over wireless cellular networks
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...