Sciweavers

899 search results - page 17 / 180
» fast 2009
Sort
View
ISMM
2009
Springer
14 years 1 months ago
Fast Implementation of the Ultimate Opening
Abstract. We present an efficient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtre...
Jonathan Fabrizio, Beatriz Marcotegui
ISSAC
2009
Springer
147views Mathematics» more  ISSAC 2009»
14 years 1 months ago
Fast algorithms for differential equations in positive characteristic
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
Alin Bostan, Éric Schost
ISSAC
2009
Springer
163views Mathematics» more  ISSAC 2009»
14 years 1 months ago
Fast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
Luca De Feo, Éric Schost
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
14 years 1 months ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
Kimmo Fredriksson, Szymon Grabowski
GD
2009
Springer
13 years 11 months ago
Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
Tim Dwyer, Lev Nachmanson