Sciweavers

7 search results - page 1 / 2
» Constructing high order elements through subspace polynomial...
Sort
View
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 7 months ago
Constructing high order elements through subspace polynomials
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
Qi Cheng, Shuhong Gao, Daqing Wan
TIFS
2008
154views more  TIFS 2008»
13 years 4 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...
IPMI
2003
Springer
14 years 5 months ago
Meshfree Representation and Computation: Applications to Cardiac Motion Analysis
Abstract. For medical image analysis issues where the domain mappings between images involve large geometrical shape changes, such as the cases of nonrigid motion recovery and inte...
Huafeng Liu, Pengcheng Shi
SAS
2009
Springer
149views Formal Methods» more  SAS 2009»
13 years 11 months ago
Creating Transformations for Matrix Obfuscation
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
Stephen Drape, Irina Voiculescu
CTCS
1989
Springer
13 years 8 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002