Sciweavers

3247 search results - page 128 / 650
» Randomized smoothing networks
Sort
View
TSP
2008
151views more  TSP 2008»
15 years 3 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
CVPR
2012
IEEE
13 years 6 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
GIS
2009
ACM
16 years 5 months ago
From GPS Traces to a Routable Road Map
This paper presents a method for automatically converting raw GPS traces from everyday vehicles into a routable road network. The method begins by smoothing raw GPS traces using a...
Lili Cao, John Krumm
ICC
2009
IEEE
113views Communications» more  ICC 2009»
15 years 10 months ago
Practical Packet Pacing in Small-Buffer Networks
Abstract—The demand for more bandwidth has lead to proposals for an all-optical network core. Due to inherent constraints of optical technology, only routers with small packet bu...
Yan Cai, Y. Sinan Hanay, Tilman Wolf
AI
2006
Springer
15 years 4 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth