Sciweavers

36781 search results - page 151 / 7357
» Parameterizing by the Number of Numbers
Sort
View
COMPSYSTECH
2011
12 years 10 months ago
Encoding watermark numbers as cographs using self-inverting permutations
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
Maria Chroni, Stavros D. Nikolopoulos
FCT
2009
Springer
14 years 5 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
DSD
2007
IEEE
133views Hardware» more  DSD 2007»
14 years 5 months ago
A Serial Logarithmic Number System ALU
Serial arithmetic uses less hardware than parallel arithmetic. Serial floating point (FP) is slower than parallel FP. The Logarithmic Number System (LNS) simplifies operations, ...
Mark G. Arnold, Panagiotis D. Vouzis
FUZZIEEE
2007
IEEE
14 years 5 months ago
Adaptive Optimization of the Number of Clusters in Fuzzy Clustering
In this paper, we present a local, adaptive optimization scheme for adjusting the number of clusters in fuzzy C-means clustering. This method is especially motivated by online app...
Jürgen Beringer, Eyke Hüllermeier
MLDM
2007
Springer
14 years 4 months ago
Kernel MDL to Determine the Number of Clusters
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...