Sciweavers

2452 search results - page 137 / 491
» The Case for Precision Sharing
Sort
View
145
Voted
FFA
2008
62views more  FFA 2008»
15 years 7 months ago
A construction of one-dimensional affine flag-transitive linear spaces
The finite flag-transitive linear spaces which have an insoluble automorphism group were given a precise description in [BDD+90], and their classification has recently been comple...
Michael Pauley, John Bamberg
COMGEO
2006
ACM
15 years 7 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
CORR
2006
Springer
78views Education» more  CORR 2006»
15 years 7 months ago
On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and ...
Stefan M. Moser
196
Voted
IPL
2006
118views more  IPL 2006»
15 years 7 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
15 years 7 months ago
Increasing Subsequences and the Classical Groups
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
Eric M. Rains