Sciweavers

2414 search results - page 221 / 483
» Computing Normal Subgroups
Sort
View
RTA
2005
Springer
14 years 3 months ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
TLCA
2005
Springer
14 years 3 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
SAC
2004
ACM
14 years 3 months ago
The effectiveness of combining information retrieval strategies for European languages
Building an effective Information Retrieval system requires various design choices, ranging from the weighting scheme to the type of morphological normalization. The combination ...
Jaap Kamps, Maarten de Rijke
VIZSEC
2004
Springer
14 years 3 months ago
User re-authentication via mouse movements
We present an approach to user re-authentication based on the data collected from the computer’s mouse device. Our underlying hypothesis is that one can successfully model user ...
Maja Pusara, Carla E. Brodley
DSD
2003
IEEE
97views Hardware» more  DSD 2003»
14 years 3 months ago
A Quadruple Precision and Dual Double Precision Floating-Point Multiplier
Double precision floating-point arithmetic is inadequate for many scientific computations. This paper presents the design of a quadruple precision floating-point multiplier tha...
Ahmet Akkas, Michael J. Schulte