Sciweavers

4277 search results - page 99 / 856
» On Multiple Linear Approximations
Sort
View
COCOON
2001
Springer
15 years 2 months ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 7 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
DATAMINE
2006
142views more  DATAMINE 2006»
14 years 10 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
DM
2007
112views more  DM 2007»
14 years 10 months ago
Affine blocking sets, three-dimensional codes and the Griesmer bound
We construct families of three-dimensional linear codes that attain the Griesmer bound and give a probablistic construction of linear codes that are close to the Griesmer bound. Al...
Simeon Ball, Elisa Montanucci
ICPR
2004
IEEE
15 years 11 months ago
Historical Document Image Enhancement Using Background Light Intensity Normalization
This paper presents a new background light intensity normalization algorithm suitable for historical document images. The algorithm uses an adaptive linear function to approximate...
Venu Govindaraju, Zhixin Shi