Sciweavers

874 search results - page 116 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
BMCBI
2005
134views more  BMCBI 2005»
14 years 9 months ago
Systematic feature evaluation for gene name recognition
In task 1A of the BioCreAtIvE evaluation, systems had to be devised that recognize words and phrases forming gene or protein names in natural language sentences. We approach this ...
Jörg Hakenberg, Steffen Bickel, Conrad Plake,...
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 1 months ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
ISSAC
2009
Springer
184views Mathematics» more  ISSAC 2009»
15 years 4 months ago
An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
Akira Terui
CONCUR
2007
Springer
15 years 4 months ago
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
Peter Lammich, Markus Müller-Olm