Sciweavers

5331 search results - page 65 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
PR
2002
91views more  PR 2002»
15 years 1 months ago
Fuzzy points: algebra and application
A fuzzy point is a region representing the uncertain location of a normal Euclidean point. A fuzzy point in the plane is considered to be a closed disk (a circle and its interior)...
Robert E. Mercer, John L. Barron, Aiden A. Bruen, ...
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 1 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...
CDC
2009
IEEE
243views Control Systems» more  CDC 2009»
15 years 6 months ago
A distributed newton method for network optimization
— Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate prope...
Ali Jadbabaie, Asuman E. Ozdaglar, Michael Zargham
ACCV
2006
Springer
15 years 7 months ago
A Bottom up Algebraic Approach to Motion Segmentation
We present a bottom up algebraic approach for segmenting multiple 2D motion models directly from the partial derivatives of an image sequence. Our method fits a polynomial called ...
Dheeraj Singaraju, René Vidal
CP
2007
Springer
15 years 5 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti