Sciweavers

3068 search results - page 349 / 614
» Clustering with Multiple Graphs
Sort
View
COMPSYSTECH
2011
14 years 6 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
COMSNETS
2012
222views more  COMSNETS 2012»
14 years 2 months ago
Exploring the design space of social network-based Sybil defenses
—Recently, there has been significant research interest in leveraging social networks to defend against Sybil attacks. While much of this work may appear similar at first glanc...
Bimal Viswanath, Mainack Mondal, Allen Clement, Pe...
ICPP
2009
IEEE
16 years 1 months ago
Speeding Up Distributed MapReduce Applications Using Hardware Accelerators
—In an attempt to increase the performance/cost ratio, large compute clusters are becoming heterogeneous at multiple levels: from asymmetric processors, to different system archi...
Yolanda Becerra, Vicenç Beltran, David Carr...
AH
2008
Springer
16 years 1 months ago
Collection Browsing through Automatic Hierarchical Tagging
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
Korinna Bade, Marcel Hermkes
ISBRA
2007
Springer
16 years 25 days ago
GFBA: A Biclustering Algorithm for Discovering Value-Coherent Biclusters
Clustering has been one of the most popular approaches used in gene expression data analysis. A clustering method is typically used to partition genes according to their similarity...
Xubo Fei, Shiyong Lu, Horia F. Pop, Lily R. Liang