Sciweavers

2370 search results - page 97 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
FUIN
2006
90views more  FUIN 2006»
14 years 10 months ago
Local Computations in Graphs: The Case of Cellular Edge Local Computations
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
Jérémie Chalopin, Yves Métivi...
CAGD
2002
61views more  CAGD 2002»
14 years 9 months ago
Polynomial parametrization of curves without affine singularities
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
Jaime Gutierrez, Rosario Rubio, Josef Schicho
IANDC
2000
70views more  IANDC 2000»
14 years 9 months ago
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
Christoph Kreitz, Stephan Schmitt
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 4 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
SIAMJO
2011
14 years 4 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu