Sciweavers

1082 search results - page 66 / 217
» Approximation Algorithms for Spreading Points
Sort
View
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
UAI
2003
13 years 9 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen
COCOA
2009
Springer
13 years 11 months ago
Positive Influence Dominating Set in Online Social Networks
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
Feng Wang 0002, Erika Camacho, Kuai Xu
ISCAS
2008
IEEE
103views Hardware» more  ISCAS 2008»
14 years 2 months ago
Watermarking curves using 2D mesh spectral transform
— This paper presents a robust watermarking method for curves that uses informed-detection. To embed watermarks, the presented algorithm parameterizes a curve using the B-spline ...
Ji Young Kim, Dong-Hyuck Im, Hae-Yeoun Lee, Heung-...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 28 days ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom