Sciweavers

3228 search results - page 458 / 646
» Computationally Sound Proofs
Sort
View
102
Voted
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
15 years 2 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen
JMIV
2010
78views more  JMIV 2010»
15 years 1 months ago
Mathematical Modeling of Textures: Application to Color Image Decomposition with a Projected Gradient Algorithm
: In this paper, we are interested in texture modeling with functional analysis spaces. We focus on the case of color image processing, and in particular color image decomposition....
Vincent Duval, Jean-François Aujol, Luminit...
135
Voted
JSC
2010
96views more  JSC 2010»
15 years 1 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
130
Voted
LICS
2010
IEEE
15 years 1 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
MICS
2010
107views more  MICS 2010»
15 years 1 months ago
The Newton Polygon of a Rational Plane Curve
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...
Carlos D'Andrea, Martín Sombra