Sciweavers

1772 search results - page 313 / 355
» Classifying Problems into Complexity Classes
Sort
View
OTM
2005
Springer
14 years 1 months ago
Peer-to-Peer Distribution Architectures Providing Uniform Download Rates
Peer-to-peer (P2P) networks have proved to be a powerful and highly scalable alternative to traditional client-server architectures for content distribution. They offer the techni...
Marc Schiely, Pascal Felber
PPDP
2005
Springer
14 years 1 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
14 years 1 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
ER
2004
Springer
106views Database» more  ER 2004»
14 years 1 months ago
Use of Tabular Analysis Method to Construct UML Sequence Diagrams
A sequence diagram in UML is used to model interactions among objects that participate in a use case. Developing a sequence diagram is complex; our experience shows that novice dev...
Margaret Hilsbos, Il-Yeol Song
HIPC
2004
Springer
14 years 1 months ago
A Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
David A. Bader, Kamesh Madduri