Sciweavers

276 search results - page 14 / 56
» Fast Algorithm for Stochastic Tree Computation
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 12 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
CVPR
2010
IEEE
14 years 3 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
ICCV
1999
IEEE
14 years 9 months ago
Unsupervised Image Classification with a Hierarchical EM Algorithm
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes...
Annabelle Chardin, Patrick Pérez
APPINF
2003
13 years 9 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo

Book
534views
15 years 5 months ago
Neural Networks - A Systematic Introduction
This book covers the following topics: The biological paradigm, Threshold logic, Weighted Networks, The Perceptron, Perceptron learning, Unsupervised learning and clustering algori...
Raul Rojas