Sciweavers

3317 search results - page 95 / 664
» Strategies in Rigid-Variable Methods
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Application of graph coloring in physical layout segmentation
Every-day, the postal sorting systems diffuse several tons of mails. It is noted that the principal origin of mail rejection is related to the failure of address-block localizatio...
Djamel Gaceb, Véronique Eglin, Frank Lebour...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 8 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
IPOM
2009
Springer
15 years 10 months ago
Traffic Classification Based on Flow Similarity
Due to the various masquerading strategies adopted by newer P2P applications to avoid detection and filtering, well-known port mapping techniques cannot guarantee their accuracy an...
Jae Yoon Chung, Byungchul Park, Young J. Won, John...
ICIP
2008
IEEE
15 years 10 months ago
Efficient nonlocal-means denoising using the SVD
Nonlocal-means (NL-means) is an image denoising method that replaces each pixel by a weighted average of all the pixels in the image. Unfortunately, the method requires the comput...
Jeff Orchard, Mehran Ebrahimi, Alexander Wong
DEXA
2007
Springer
140views Database» more  DEXA 2007»
15 years 10 months ago
Clustering-Based K-Anonymisation Algorithms
Abstract. K-anonymisation is an approach to protecting private information contained within a dataset. Many k-anonymisation methods have been proposed recently and one class of suc...
Grigorios Loukides, Jianhua Shao