Sciweavers

10988 search results - page 1948 / 2198
» Algorithmic Folding Complexity
Sort
View
COR
2010
177views more  COR 2010»
15 years 4 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
CLEIEJ
2008
82views more  CLEIEJ 2008»
15 years 4 months ago
Postal Envelope Segmentation using Learning-Based Approach
This paper presents a learning-based approach to segment postal address blocks where the learning step uses only one pair of images (a sample image and its ideal segmented solutio...
Horacio Andrés Legal-Ayala, Jacques Facon, ...
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 4 months ago
Color Image Compression Based On Wavelet Packet Best Tree
In Image Compression, the researchers' aim is to reduce the number of bits required to represent an image by removing the spatial and spectral redundancies. Recently discrete...
Gajanan K. Kharate, Varsha H. Patil
118
Voted
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 4 months ago
Discrete denoising of heterogenous two-dimensional data
We consider discrete denoising of two-dimensional data with characteristics that may be varying abruptly between regions. Using a quadtree decomposition technique and space-fillin...
Taesup Moon, Tsachy Weissman, Jae-Young Kim
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 4 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
« Prev « First page 1948 / 2198 Last » Next »