Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,185
Pegasos: Primal Estimated sub-gradient solver for SVM
"... We describe and analyze a simple and effective stochastic sub-gradient descent algorithm for solving the optimization problem cast by Support Vector Machines (SVM). We prove that the number of iterations required to obtain a solution of accuracy ɛ is Õ(1/ɛ), where each iteration operates on a singl ..."
Abstract
-
Cited by 542 (20 self)
- Add to MetaCart
single training example. In contrast, previous analyses of stochastic gradient descent methods for SVMs require Ω(1/ɛ2) iterations. As in previously devised SVM solvers, the number of iterations also scales linearly with 1/λ, where λ is the regularization parameter of SVM. For a linear kernel, the total
CUTE: A Concolic Unit Testing Engine for C
- IN ESEC/FSE-13: PROCEEDINGS OF THE 10TH EUROPEAN
, 2005
"... In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses the pro ..."
Abstract
-
Cited by 480 (22 self)
- Add to MetaCart
the problem of automating unit testing with memory graphs as inputs. The approach used builds on previous work combining symbolic and concrete execution, and more specifically, using such a combination to generate test inputs to explore all feasible execution paths. The current work develops a method
Control of Systems Integrating Logic, Dynamics, and Constraints
- Automatica
, 1998
"... This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real and ..."
Abstract
-
Cited by 413 (50 self)
- Add to MetaCart
reference trajectories while fulfilling operating constraints, and possibly take into account previous qualitative knowledge in the form of heuristic rules. Due to the presence of integer variables, the resulting on-line optimization procedures are solved through Mixed Integer Quadratic Programming (MIQP
SUNDIALS: Suite of Nonlinear and Differential/ Algebraic Equation Solvers
- ACM Trans. Math. Software
, 2005
"... SUNDIALS is a suite of advanced computational codes for solving large-scale problems that can be modeled as a system of nonlinear algebraic equations, or as initial-value problems in ordi-nary differential or differential-algebraic equations. The basic versions of these codes are called KINSOL, CVOD ..."
Abstract
-
Cited by 162 (6 self)
- Add to MetaCart
and heuristics used to achieve efficiency and robustness. We also describe how the codes stem from previous and widely used Fortran 77 solvers, and how the codes have been augmented with forward and adjoint methods for carrying out first-order sensitivity analysis with respect to model parameters or initial
BoomerAMG: a Parallel Algebraic Multigrid Solver and Preconditioner
- Applied Numerical Mathematics
, 2000
"... Driven by the need to solve linear sytems arising from problems posed on extremely large, unstructured grids, there has been a recent resurgence of interest in algebraic multigrid (AMG). AMG is attractive in that it holds out the possibility of multigridlike performance on unstructured grids. The sh ..."
Abstract
-
Cited by 129 (10 self)
- Add to MetaCart
of coarse-grid selection, in particular, is fundamentally sequential in nature. We have previously introduced a parallel algorithm [7] for the selection of coarsegrid points, based on modifications of certain parallel independent set algorithms and the application of heuristics designed to insure
Effective preprocessing in SAT through variable and clause elimination
- in Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT’05), ser. Lecture Notes in Computer Science
, 2005
"... Abstract. Preprocessing SAT instances can reduce their size considerably. We combine variable elimination with subsumption and selfsubsuming resolution, and show that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also decr ..."
Abstract
-
Cited by 183 (14 self)
- Add to MetaCart
Abstract. Preprocessing SAT instances can reduce their size considerably. We combine variable elimination with subsumption and selfsubsuming resolution, and show that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also
Optimal Ordered Problem Solver
, 2002
"... We present a novel, general, optimally fast, incremental way of searching for a universal algorithm that solves each task in a sequence of tasks. The Optimal Ordered Problem Solver (OOPS) continually organizes and exploits previously found solutions to earlier tasks, eciently searching not only the ..."
Abstract
-
Cited by 70 (21 self)
- Add to MetaCart
We present a novel, general, optimally fast, incremental way of searching for a universal algorithm that solves each task in a sequence of tasks. The Optimal Ordered Problem Solver (OOPS) continually organizes and exploits previously found solutions to earlier tasks, eciently searching not only
An Approximate Riemann Solver for Magnetohydrodynamics
, 1994
"... An approximate Riemann solver is developed for the governing equations of ideal magnetohydrodynamics (MHD). The Riemann solver has an eight-wave structure, where seven of the waves are those used in previous work on upwind schemes for MHD, and the eighth wave is related to the divergence of the magn ..."
Abstract
-
Cited by 65 (9 self)
- Add to MetaCart
An approximate Riemann solver is developed for the governing equations of ideal magnetohydrodynamics (MHD). The Riemann solver has an eight-wave structure, where seven of the waves are those used in previous work on upwind schemes for MHD, and the eighth wave is related to the divergence
Mesh Editing with Poisson-Based Gradient Field Manipulation
- ACM TRANS. GRAPH
, 2004
"... In this paper, we introduce a novel approach to mesh editing with the Poisson equation as the theoretical foundation. The most distinctive feature of this approach is that it modifies the original mesh geometry implicitly through gradient field manipulation. Our approach can produce desirable and pl ..."
Abstract
-
Cited by 175 (17 self)
- Add to MetaCart
solver based on the Poisson equation, a gradient field manipulation scheme using local transforms, and a generalized boundary condition representation based on local frames. Experimental results indicate that our framework can outperform previous related mesh editing techniques.
Undirected ST-Connectivity in Log-Space
, 2004
"... We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log 4/3 (·) obtained by Armoni, Ta-Shma, Wigderson and Zhou [ATSWZ00]. As undirected st-connectivity is complete for the clas ..."
Abstract
-
Cited by 162 (3 self)
- Add to MetaCart
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log 4/3 (·) obtained by Armoni, Ta-Shma, Wigderson and Zhou [ATSWZ00]. As undirected st-connectivity is complete
Results 1 - 10
of
2,185
