3019 search results - page 14 / 604 » Approximating the Domatic Number |
JCO
2011
14 years 6 months ago
2011
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...
113
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
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...
109
click to vote
SECON
2010
IEEE
14 years 9 months ago
2010
IEEE
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...
ARITH
1999
IEEE
15 years 4 months ago
1999
IEEE
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...
128
click to vote
MLDM
2010
Springer
14 years 6 months ago
2010
Springer
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...