Sciweavers

550 search results - page 23 / 110
» Optimization and Approximation Problems Related to Polynomia...
Sort
View
DCOSS
2006
Springer
14 years 14 days ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
ICCV
2009
IEEE
15 years 1 months ago
An Algebraic Approach to Affine Registration of Point Sets
This paper proposes a new affine registration algorithm for matching two point sets in IR2 or IR3. The input point sets are represented as probability density functions, using e...
Jeffrey Ho, Adrian Peter, Anand Rangarajan, Ming-H...
IOR
2008
119views more  IOR 2008»
13 years 8 months ago
Integrating Approximation and Interactive Decision Making in Multicriteria Optimization
We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. W...
Kathrin Klamroth, Kaisa Miettinen
FOCS
2002
IEEE
14 years 1 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 6 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras