Sciweavers

756 search results - page 32 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
UAI
2004
15 years 5 months ago
On the Choice of Regions for Generalized Belief Propagation
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
Max Welling
IWCIA
2004
Springer
15 years 9 months ago
Corner Detection and Curve Partitioning Using Arc-Chord Distance
Abstract. Several authors have proposed algorithms for curve partitioning using the arc-chord distance formulation, where a chord whose associated arc spans k pixels is moved along...
Majed Marji, Reinhard Klette, Pepe Siy
185
Voted
SIAMCOMP
2011
14 years 11 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
117
Voted
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 4 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
132
Voted
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
15 years 5 months ago
A new quantum behaved particle swarm optimization
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
Millie Pant, Radha Thangaraj, Ajith Abraham