Sciweavers

15792 search results - page 2798 / 3159
» Computational Abstraction Steps
Sort
View
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 10 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
CAV
2004
Springer
108views Hardware» more  CAV 2004»
15 years 10 months ago
Functional Dependency for Verification Reduction
Abstract. The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal...
Jie-Hong Roland Jiang, Robert K. Brayton
180
Voted
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin
APWEB
2006
Springer
15 years 10 months ago
The Case of the Duplicate Documents Measurement, Search, and Science
Many of the documents in large text collections are duplicates and versions of each other. In recent research, we developed new methods for finding such duplicates; however, as the...
Justin Zobel, Yaniv Bernstein
« Prev « First page 2798 / 3159 Last » Next »