Sciweavers

5864 search results - page 67 / 1173
» Can We Work around Numerical Methods
Sort
View
MICCAI
2001
Springer
15 years 8 months ago
Implicit Snakes: Active Constrained Implicit Models
Extended Abstract: We are exploring new techniques for active contour models (popularly known as “snakes”[1]) by combining active segmentation models with the constrained impli...
Terry S. Yoo, Kalpathi R. Subramanian
142
Voted
ALMOB
2006
106views more  ALMOB 2006»
15 years 4 months ago
Multiple sequence alignment with user-defined anchor points
Background: Automated software tools for multiple alignment often fail to produce biologically meaningful results. In such situations, expert knowledge can help to improve the qua...
Burkhard Morgenstern, Sonja J. Prohaska, Dirk P&ou...
ARC
2012
Springer
317views Hardware» more  ARC 2012»
13 years 11 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
132
Voted
AIPS
2006
15 years 5 months ago
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
Jörg Hoffmann, Carla P. Gomes, Bart Selman
ANOR
2004
122views more  ANOR 2004»
15 years 3 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...