Sciweavers

7015 search results - page 200 / 1403
» Approximation algorithms for co-clustering
Sort
View
RSA
2002
73views more  RSA 2002»
15 years 6 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro
ARITH
2007
IEEE
16 years 25 days ago
Floating-point L2-approximations to functions
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Nicolas Brisebarre, Guillaume Hanrot
ICPR
2006
IEEE
16 years 7 months ago
Fingerprint Image Enhancement Based on Skin Profile Approximation
The performance of the fingerprint identification and verification systems relies heavily on the quality of the input fingerprint images. In this paper, we propose an effective im...
Venu Govindaraju, Zhixin Shi
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
16 years 1 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
16 years 1 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz