Sciweavers

42 search results - page 2 / 9
» Schreier decomposition of loops
Sort
View
IROS
2007
IEEE
92views Robotics» more  IROS 2007»
13 years 11 months ago
A space decomposition method for path planning of loop linkages
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
Josep M. Porta, Juan Cortés, Lluís R...
ICIP
1997
IEEE
14 years 7 months ago
Bit Allocation Methods for Closed-Loop Coding of Oversampled Pyramid Decompositions
Oversampled pyramid decompositions have been successfully applied to scalable video coding. Quantization noise feedback at the encoder closed-loop coding" has several advant...
Uwe Horn, Thomas Wiegand, Bernd Girod
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 5 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
ANNPR
2006
Springer
13 years 9 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe
ERSHOV
2009
Springer
14 years 12 hour ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács