Sciweavers

5019 search results - page 14 / 1004
» Computing in Quotient Groups
Sort
View
TCS
2008
15 years 1 months ago
On the weight of universal insertion grammars
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
Lila Kari, Petr Sosík
ICPR
2004
IEEE
16 years 3 months ago
Location and Recognition of Flashlight Projections for Visual Interfaces
We consider the location and recognition of flashlight projections given the image sequence supplied by a fixed camera monitoring a physical surface. A quotient method extracts a ...
Ahmed Ghali, Jonathan Green, Steve Benford, Tony P...
AAECC
2000
Springer
81views Algorithms» more  AAECC 2000»
15 years 1 months ago
On Short Multiplications and Divisions
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
Thom Mulders
ICPR
2010
IEEE
14 years 11 months ago
Fundamental Geodesic Deformations in Spaces of Treelike Shapes
This paper presents a new geometric framework for analysis of planar treelike shapes for applications such as shape matching, recognition and morphology, using the geometry of the...
Aasa Feragen, François Lauze, Mads Nielsen
CAP
2010
14 years 9 months ago
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Michael B. Monagan, Roman Pearce