Sciweavers

11565 search results - page 2176 / 2313
» Computing Minimal Mappings
Sort
View
TPDS
2008
140views more  TPDS 2008»
13 years 9 months ago
High-Performance Resource Allocation and Request Redirection Algorithms for Web Clusters
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...
Supranamaya Ranjan, Edward W. Knightly
JMM2
2007
96views more  JMM2 2007»
13 years 9 months ago
Software Watermarking Resilient to Debugging Attacks
Abstract— In 2006, Gaurav Gupta and Josef Pieprzyk presented an attack on the branch-based software watermarking scheme proposed by Ginger Myles and Hongxia Jin in 2005. The softw...
Gaurav Gupta, Josef Pieprzyk
COMGEO
2004
ACM
13 years 9 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
EC
2002
228views ECommerce» more  EC 2002»
13 years 9 months ago
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Gen
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we pre...
Rajeev Kumar, Peter Rockett
IJCM
2002
97views more  IJCM 2002»
13 years 9 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
« Prev « First page 2176 / 2313 Last » Next »