Sciweavers

17505 search results - page 3367 / 3501
» Use Cases as Workflows
Sort
View
SPAA
2003
ACM
15 years 9 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
148
Voted
ASIACRYPT
2003
Springer
15 years 9 months ago
Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes
Abstract. We study two closely related primitives: Broadcast Encryption and Key Predistribution Schemes (KPS). Broadcast Encryption allows a broadcaster to broadcast an encrypted m...
Nuttapong Attrapadung, Kazukuni Kobara, Hideki Ima...
CAISE
2003
Springer
15 years 9 months ago
Introducing Custom Language Extensions to SQL: 1999
Abstract. Even though SQL has become widely accepted as a language for implementing relational database schemas and querying data, there are cases where s experience the need for n...
Jernej Kovse, Wolfgang Mahnke
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 9 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
« Prev « First page 3367 / 3501 Last » Next »