Sciweavers

840 search results - page 153 / 168
» The Complexity of the Extended GCD Problem
Sort
View
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 9 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 9 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
AML
2008
124views more  AML 2008»
13 years 7 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
AROBOTS
2008
177views more  AROBOTS 2008»
13 years 7 months ago
Controlling swimming and crawling in a fish robot using a central pattern generator
Online trajectory generation for robots with multiple degrees of freedom is still a difficult and unsolved problem, in particular for non-steady state locomotion, that is, when th...
Alessandro Crespi, Daisy Lachat, Ariane Pasquier, ...
CCE
2008
13 years 7 months ago
Dynamic scheduling of multiproduct pipelines with multiple delivery due dates
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Mo...
Diego C. Cafaro, Jaime Cerdá