Sciweavers

2297 search results - page 119 / 460
» A fast APRIORI implementation
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Fast texture segmentation model based on the shape operator and active contour
We present an approach for unsupervised segmentation of natural and textural images based on active contour, differential geometry and information theoretical concept. More precis...
Nawal Houhou, Jean-Philippe Thiran, Xavier Bresson
ICIP
2001
IEEE
16 years 21 days ago
B-spline active contours for fast video segmentation
Video segmentation is among the most important challenges of video processing and compression (MPEG-4 and MPEG-7). A drawback of classical methods is the computational cost due to...
Frédéric Precioso, Michel Barlaud
ICIP
1998
IEEE
16 years 19 days ago
Fast Blind Inverse Halftoning
We present a fast, non-iterative technique for producing grayscale images from error diffused and dithered halftones. The first stage of the algorithm consists of a Gaussian filte...
Niranjan Damera-Venkata, Thomas D. Kite, Mahalaksh...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
15 years 11 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
88
Voted
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
15 years 11 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan