Sciweavers

184 search results - page 24 / 37
» A New Algorithm of Constructing the Basis Finite Automaton
Sort
View
JAIR
2008
103views more  JAIR 2008»
14 years 9 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
COMPUTING
2006
126views more  COMPUTING 2006»
14 years 9 months ago
Algebraic Multigrid Based on Computational Molecules, 1: Scalar Elliptic Problems
We consider the problem of splitting a symmetric positive definite (SPD) stiffness matrix A arising from finite element discretization into the sum of edge matrices thereby assumi...
J. K. Kraus, Josef Schicho
OOPSLA
1991
Springer
15 years 1 months ago
Object-Oriented Type Inference
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
Jens Palsberg, Michael I. Schwartzbach
ICASSP
2011
IEEE
14 years 1 months ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
ASIACRYPT
2006
Springer
15 years 1 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...