Sciweavers

98 search results - page 4 / 20
» A note on weak dividing
Sort
View
ENTCS
2000
97views more  ENTCS 2000»
13 years 7 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba
INDOCRYPT
2007
Springer
14 years 1 months ago
Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses
The stream cipher TPypy has been designed by Biham and Seberry in January 2007 as the strongest member of the Py-family ciphers, after weaknesses in the other members Py, Pypy, Py...
Gautham Sekar, Souradyuti Paul, Bart Preneel
JPDC
2007
191views more  JPDC 2007»
13 years 7 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
AUSDM
2006
Springer
100views Data Mining» more  AUSDM 2006»
13 years 11 months ago
Data Mining Methodological Weaknesses and Suggested Fixes
Predictive accuracy claims should give explicit descriptions of the steps followed, with access to the code used. This allows referees and readers to check for common traps, and t...
John H. Maindonald
EUROCRYPT
1999
Springer
13 years 11 months ago
A Note on the Limits of Collusion-Resistant Watermarks
In one proposed use of digital watermarks, the owner of a document D sells slightly different documents, D1 , D2 , . . . to each buyer; if a buyer posts his/her document Di to the...
Funda Ergün, Joe Kilian, Ravi Kumar