Sciweavers

287 search results - page 37 / 58
» Optimal Histograms with Quality Guarantees
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 4 months ago
Search-based testing of service level agreements
The diffusion of service oriented architectures introduces the need for novel testing approaches. On the one side, testing must be able to identify failures in the functionality ...
Massimiliano Di Penta, Gerardo Canfora, Gianpiero ...
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 2 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
COLT
2008
Springer
13 years 11 months ago
Relating Clustering Stability to Properties of Cluster Boundaries
In this paper, we investigate stability-based methods for cluster model selection, in particular to select the number K of clusters. The scenario under consideration is that clust...
Shai Ben-David, Ulrike von Luxburg
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 10 months ago
An LSB Data Hiding Technique Using Natural Numbers
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1] based on decomposition of ...
Sandipan Dey, Ajith Abraham, Sugata Sanyal
DAM
2006
132views more  DAM 2006»
13 years 9 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler