Sciweavers

3247 search results - page 139 / 650
» Randomized smoothing networks
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 4 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
WWW
2010
ACM
15 years 11 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
ICASSP
2009
IEEE
15 years 10 months ago
Conditional random fields for the prediction of signal peptide cleavage sites
Correct prediction of signal peptide cleavage sites has a significant impact on drug design. State-of-the-art approaches to cleavage site prediction typically use generative mode...
Man-Wai Mak, Sun-Yuan Kung
SAC
2004
ACM
15 years 9 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 9 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...