Sciweavers

4212 search results - page 11 / 843
» On Compressible Pairings and Their Computation
Sort
View
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
BMCBI
2010
112views more  BMCBI 2010»
13 years 7 months ago
Computational identification of rare codons of Escherichia coli based on codon pairs preference
Background: Codon bias is believed to play an important role in the control of gene expression. In Escherichia coli, some rare codons, which can limit the expression level of exog...
Xianming Wu, Songfeng Wu, Dong Li, Jiyang Zhang, L...
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 7 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
RTA
2010
Springer
13 years 11 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
ICALP
2010
Springer
13 years 11 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis