Sciweavers

139 search results - page 7 / 28
» Computing crossing numbers in quadratic time
Sort
View
EUROCRYPT
2011
Springer
13 years 2 days ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
BMCBI
2010
175views more  BMCBI 2010»
13 years 8 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng
ICALP
2005
Springer
14 years 2 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
SIAMCOMP
2010
100views more  SIAMCOMP 2010»
13 years 7 months ago
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Markus Kirschmer, John Voight
TCSV
2010
13 years 3 months ago
Cross-Layer Packet Retry Limit Adaptation for Video Transport Over Wireless LANs
Video transport over wireless networks requires retransmissions to successfully deliver video data to a receiver in case of packet loss, leading to increased delay time for the dat...
Chih-Ming Chen, Chia-Wen Lin, Yung-Chang Chen