Sciweavers

ANTS
2008
Springer
70views Algorithms» more  ANTS 2008»
14 years 1 months ago
Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian
Pieter Rozenhart, Renate Scheidler
ANTS
2008
Springer
108views Algorithms» more  ANTS 2008»
14 years 1 months ago
Some Improvements to 4-Descent on an Elliptic Curve
The theory of 4-descent on elliptic curves has been developed in the PhD theses of Siksek [18], Womack [21] and Stamminger [20]. Prompted by our use of 4-descent in the search for ...
Tom Fisher
ANTS
2008
Springer
73views Algorithms» more  ANTS 2008»
14 years 1 months ago
K3 Surfaces of Picard Rank One and Degree Two
We construct explicit examples of K3 surfaces over
Andreas-Stephan Elsenhans, Jörg Jahnel
ANCS
2008
ACM
14 years 1 months ago
Towards effective network algorithms on multi-core network processors
To build high-performance network devices with holistic security protection, a large number of algorithms have been proposed. However, multi-core implementation of the existing al...
Yaxuan Qi, Zongwei Zhou, Baohua Yang, Fei He, Yibo...
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 1 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
ACMSE
2008
ACM
14 years 1 months ago
Optimization of the multiple retailer supply chain management problem
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
Caio Soares, Gerry V. Dozier, Emmett Lodree, Jared...
AAIM
2008
Springer
138views Algorithms» more  AAIM 2008»
14 years 1 months ago
Confidently Cutting a Cake into Approximately Fair Pieces
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
AAIM
2008
Springer
208views Algorithms» more  AAIM 2008»
14 years 1 months ago
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
Yunhong Zhou, Dennis M. Wilkinson, Robert Schreibe...
AAAI
2008
14 years 2 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
AAAI
2008
14 years 2 months ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown