Sciweavers

1243 search results - page 55 / 249
» Complexity reduction of C-Algorithm
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 6 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
KR
2004
Springer
15 years 6 months ago
Inferential Complexity Control for Model-Based Abduction
We describe a technique for speeding up inference for model-based abduction tasks that trades off inference time and/or space for the fraction of queries correctly answered. We co...
Gregory M. Provan
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 6 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
DAGSTUHL
2004
15 years 2 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
PR
2002
129views more  PR 2002»
15 years 29 days ago
Text extraction in complex color documents
Text extraction in mixed-type documents is a pre-processing and necessary stage for many document applications. In mixed-type color documents, text, drawings and graphics appear w...
Charalambos Strouthopoulos, Nikos Papamarkos, Anto...