Sciweavers

2745 search results - page 192 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 7 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
IBPRIA
2005
Springer
15 years 9 months ago
A Real-Time Gabor Primal Sketch for Visual Attention
We describe a fast algorithm for Gabor filtering, specially designed for multi-scale image representations. Our proposal is based on three facts: first, Gabor functions can be de...
Alexandre Bernardino, José Santos-Victor
PR
2006
101views more  PR 2006»
15 years 4 months ago
Efficient Legendre moment computation for grey level images
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
G. Y. Yang, Huazhong Shu, Christine Toumoulin, Guo...
ICPP
2003
IEEE
15 years 9 months ago
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
Martha Torres, Alfredo Goldman, Junior Barrera