1399 search results - page 67 / 280 » New Algorithms for k-Center and Extensions |
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We present and evaluate a new multiple-description coding extension to the international standard for pulse code modulation speech coding (ITU-T Rec. G.711). This extension is inse...
CPAIOR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
— This paper presents new upper bounds for binary covering arrays of variable strength constructed by using a new Simulated Annealing (SA) algorithm. This algorithm incorporates ...
DMIN
2007
13 years 10 months ago
2007
Abstract — New privacy regulations together with everincreasing data availability and computational power have created a huge interest in data privacy research. One major researc...
SGP
2007
13 years 11 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...