Sciweavers

1356 search results - page 240 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
EUROCRYPT
2012
Springer
11 years 10 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
CODES
2007
IEEE
14 years 1 months ago
A code-generator generator for multi-output instructions
We address the problem of instruction selection for Multi-Output Instructions (MOIs), producing more than one result. Such inherently parallel hardware instructions are very commo...
Hanno Scharwächter, Jonghee M. Youn, Rainer L...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
MASCOTS
2010
13 years 9 months ago
PUD-LRU: An Erase-Efficient Write Buffer Management Algorithm for Flash Memory SSD
Flash memory SSDs pose a well-known challenge, that is, the erase-before-write problem. Researchers try to solve this inherent problem from two different angles by either designing...
Jian Hu, Hong Jiang, Lei Tian, Lei Xu
BMCBI
2008
139views more  BMCBI 2008»
13 years 7 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg