Sciweavers

155 search results - page 17 / 31
» Symplectic Alternating Algebras
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
ANTS
2004
Springer
103views Algorithms» more  ANTS 2004»
13 years 11 months ago
A Comparison of CEILIDH and XTR
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR. Underpinning both systems is the mathematics of the two dimen...
Robert Granger, Dan Page, Martijn Stam
JLP
2007
91views more  JLP 2007»
13 years 7 months ago
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is th...
Marco Bernardo
ENTCS
2002
101views more  ENTCS 2002»
13 years 7 months ago
A categorical framework for typing CCS-style process communication
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
Ralf Schweimeier
ICASSP
2008
IEEE
14 years 2 months ago
Density geodesics for similarity clustering
We address the problem of similarity metric selection in pairwise affinity clustering. Traditional techniques employ standard algebraic context-independent sample-distance measur...
Umut Ozertem, Deniz Erdogmus, Miguel Á. Car...