Sciweavers

124 search results - page 5 / 25
» On the Computability of Rectifiable Simple Curve (Extended A...
Sort
View
SAC
2003
ACM
14 years 21 days ago
Similar_Join: Extending DBMS with a Bio-specific Operator
Existing sequence comparison software applications lack automation, abstraction, performance, and flexibility. Users need a new way of studying and applying sequence comparisons i...
Jake Yue Chen, John V. Carlis
MFCS
2004
Springer
14 years 24 days ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
CSREASAM
2008
13 years 9 months ago
Implementing Cryptography for Packet Level Authentication
Abstract--Packet Level Authentication (PLA) is a novel countermeasure against distributed denial-of-service attacks. Each packet sent across a network has a digital signature and p...
Billy Bob Brumley
EUROPKI
2004
Springer
14 years 25 days ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
COMPGEOM
2001
ACM
13 years 11 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...