Sciweavers

724 search results - page 56 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
ECCV
2006
Springer
16 years 1 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
CARDIS
1998
Springer
121views Hardware» more  CARDIS 1998»
15 years 4 months ago
Efficient Smart-Card Based Anonymous Fingerprinting
Abstract. Thwarting unlawful redistribution of information sold electronically is a major problem of information-based electronic commerce. Anonymous fingerprinting has appeared as...
Josep Domingo-Ferrer, Jordi Herrera-Joancomart&iac...
AI
2003
Springer
15 years 5 months ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
ICIP
2006
IEEE
16 years 1 months ago
Developing an Efficient Region Growing Engine for Image Segmentation
Image segmentation is a crucial part of image processing applications. Currently available approaches require significant computer power to handle large images. We present an effi...
Emanuel Gofman
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 1 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov