Sciweavers

23590 search results - page 607 / 4718
» Algorithm Performance Contest
Sort
View
ICIP
2000
IEEE
16 years 8 months ago
A Fast Hierarchical Algorithm of Maximum Intensity Projection
The maximum intensity projection (MIP) is a useful tool to visualize 3D images. The processing time of the MIP depends on the number of voxels of the 3D data. Therefore, it is ver...
Keun Ho Kim, Min Jeong Kwon, Hyun Wook Park
151
Voted
ICIP
1999
IEEE
16 years 8 months ago
A Fast Segmentation Algorithm for Bi-Level Image Compression Using JBIG2
The emerging JBIG2 standard allows compliant encoders to achieve very high compression rates on bi-level images, especially when images are properly segmented into regions of line...
Dave A. D. Tompkins, Faouzi Kossentini
ICC
2009
IEEE
103views Communications» more  ICC 2009»
16 years 1 months ago
A Distributed Algorithm for Least Constraining Slot Allocation in MPLS Optical TDM Networks
- In this paper, we propose a distributed approach for the least constraining slot allocation scheme in all-optical TDM networks (LC) that was introduced in a previous work. The dr...
Hassan Zeineddine, Gregor von Bochmann
148
Voted
SP
2009
IEEE
16 years 1 months ago
Exploiting Unix File-System Races via Algorithmic Complexity Attacks
We defeat two proposed Unix file-system race condition defense mechanisms. First, we attack the probabilistic defense mechanism of Tsafrir, et al., published at USENIX FAST 2008[...
Xiang Cai, Yuwei Gui, Rob Johnson
EPIA
2009
Springer
16 years 28 days ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...