Sciweavers

3019 search results - page 14 / 604
» Approximating the Domatic Number
Sort
View
JCO
2011
115views more  JCO 2011»
13 years 2 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 9 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
SECON
2010
IEEE
13 years 5 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
ARITH
1999
IEEE
13 years 11 months ago
Complex Logarithmic Number System Arithmetic Using High-Radix Redundant CORDIC Algorithms
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...
David Lewis
MLDM
2010
Springer
13 years 2 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran