Sciweavers

8298 search results - page 127 / 1660
» On the Complexity of Numerical Analysis
Sort
View
TSP
2008
140views more  TSP 2008»
15 years 6 months ago
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
I. Bayram, Ivan W. Selesnick
DIAL
2004
IEEE
136views Image Analysis» more  DIAL 2004»
15 years 10 months ago
Line Separation for Complex Document Images Using Fuzzy Runlength
A new text line location and separation algorithm for complex handwritten documents is proposed. The algorithm is based on the application of a fuzzy directional runlength. The pr...
Zhixin Shi, Venu Govindaraju
AAAI
1990
15 years 7 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
AMC
2007
108views more  AMC 2007»
15 years 6 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
ICALP
2000
Springer
15 years 10 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée