Sciweavers

5510 search results - page 758 / 1102
» Mathematics
Sort
View
197
Voted
ICNC
2005
Springer
16 years 8 days ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
IPSN
2005
Springer
16 years 8 days ago
QoM and lifetime-constrained random deployment of sensor networks for minimum energy consumption
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
Morteza Maleki, Massoud Pedram
ISMIR
2005
Springer
135views Music» more  ISMIR 2005»
16 years 7 days ago
Automatic X Traditional Descriptor Extraction: the Case of Chord Recognition
Audio descriptor extraction is the activity of finding mathematical models which describe properties of the sound, requiring signal processing skills. The scientific literature pr...
Giordano Ribeiro de Eulalio Cabral, Françoi...
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 7 days ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
ISSAC
2005
Springer
97views Mathematics» more  ISSAC 2005»
16 years 7 days ago
Probabilistic algorithms for computing resultants
Let A and B be two polynomials in   [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
Michael B. Monagan