Sciweavers

13603 search results - page 2415 / 2721
» On the Complexity of Computing Treelength
Sort
View
221
Voted
JCM
2006
112views more  JCM 2006»
15 years 6 months ago
A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis
The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that user...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...
DKE
2007
105views more  DKE 2007»
15 years 6 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
JCP
2006
100views more  JCP 2006»
15 years 6 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
JEI
2006
128views more  JEI 2006»
15 years 6 months ago
Performance study of common image steganography and steganalysis techniques
Abstract. We investigate the performance of state of the art universal steganalyzers proposed in the literature. These universal steganalyzers are tested against a number of well-k...
Mehdi Kharrazi, Husrev T. Sencar, Nasir D. Memon
ECCC
2007
123views more  ECCC 2007»
15 years 6 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
« Prev « First page 2415 / 2721 Last » Next »