Sciweavers

545 search results - page 83 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
BMCBI
2010
128views more  BMCBI 2010»
13 years 8 months ago
MPprimer: a program for reliable multiplex PCR primer design
Background: Multiplex PCR, defined as the simultaneous amplification of multiple regions of a DNA template or multiple DNA templates using more than one primer set (comprising a f...
Zhiyong Shen, Wubin Qu, Wen Wang, Yiming Lu, Yongh...
CN
2006
74views more  CN 2006»
13 years 8 months ago
Measurement-based optimal routing on overlay architectures for unicast sessions
We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multiple unicast sources. Multiple paths are established using overla...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 6 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 8 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
FOCS
2008
IEEE
14 years 2 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic