Sciweavers

361 search results - page 35 / 73
» Algorithms for Extracting Timeliness Graphs
Sort
View
MLDM
2005
Springer
14 years 2 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé
ICPR
2010
IEEE
13 years 11 months ago
Entropy Estimation and Multi-Dimensional Scale Saliency
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
Pablo Suau, Francisco Escolano
CAL
2008
13 years 8 months ago
Pipelined Architecture for Multi-String Matching
We present a pipelined approach to hardware implementation of the Aho-Corasick (AC) algorithm for string matching called P-AC. By incorporating pipelined processing, the state grap...
Derek Chi-Wai Pao, Wei Lin, Bin Liu
IJCV
2006
299views more  IJCV 2006»
13 years 8 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
CVPR
2000
IEEE
14 years 10 months ago
Fixed Topology Skeletons
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...
Polina Golland, W. Eric L. Grimson