Sciweavers

5451 search results - page 1 / 1091
» On very high degrees
Sort
View
JSYML
2008
53views more  JSYML 2008»
13 years 7 months ago
On very high degrees
In this paper we show that there is a pair of superhigh r.e. degree that forms a minimal pair. An analysis of the proof shows that a critical ingredient is the growth rates of cert...
Keng Meng Ng
PKC
2010
Springer
162views Cryptology» more  PKC 2010»
13 years 11 months ago
Faster Pairing Computations on Curves with High-Degree Twists
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
Craig Costello, Tanja Lange, Michael Naehrig
IVS
2002
106views more  IVS 2002»
13 years 7 months ago
Pixel bar charts: a visualization technique for very large multi-attribute data sets?
Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data presenting only a very small number of data values (as in the case of bar charts) ...
Daniel A. Keim, Ming C. Hao, Umeshwar Dayal, Meich...
ISCAPDCS
2004
13 years 8 months ago
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
Yamin Li, Shietung Peng, Wanming Chu
ICFP
2010
ACM
13 years 8 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao