Sciweavers

1243 search results - page 84 / 249
» Complexity reduction of C-Algorithm
Sort
View
WIA
2004
Springer
15 years 6 months ago
Brute Force Determinization of NFAs by Means of State Covers
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
PROPERTYTESTING
2010
14 years 11 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
TCSV
2010
14 years 8 months ago
Subsampled Block-Matching for Zoom Motion Compensated Prediction
Motion compensated prediction plays a vital role in achieving enormous video compression efficiency in advanced video coding standards. Most practical motion compensated prediction...
Lai-Man Po, Ka-Man Wong, Kwok-Wai Cheung, Ka-Ho Ng
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 7 months ago
Turbo Equalization for Clipped and Filtered COFDM Signals
— Clipping and filtering is an attractive method for the reduction of the PAPR of OFDM signals before transmission. However, the resulting in-band distortion noise impacts the e...
Peter Zillmann, Wolfgang Rave, Gerhard Fettweis
ICPR
2000
IEEE
15 years 5 months ago
Piecewise Linear Two-Dimensional Warping
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
Seiichi Uchida, Hiroaki Sakoe