204 search results - page 13 / 41 » Powered Tate Pairing Computation |
81
Voted
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
WIOPT
2010
IEEE
2010
IEEE
Low complexity algorithms for relay selection and power control in interference-limited environments
14 years 7 months ago
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
MFCS
2001
Springer
15 years 1 months ago
2001
Springer
We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-c...
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
Canonical correlation analysis (CCA) is a powerful tool for analyzing multi-dimensional paired data. However, CCA tends to perform poorly when the number of paired samples is limit...
108
Voted
ISSPIT
2010
14 years 4 months ago
2010
Graphics processing units (GPU) on commodity video cards have evolved into powerful computational devices. The RNA secondary structure arises from the primary structure and a backb...