Sciweavers

227 search results - page 13 / 46
» Pairwise Clustering and Graphical Models
Sort
View
CVPR
2007
IEEE
14 years 8 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz
ICA3PP
2010
Springer
13 years 11 months ago
Accelerating Euler Equations Numerical Solver on Graphics Processing Units
Abstract. Finite volume numerical methods have been widely studied, implemented and parallelized on multiprocessor systems or on clusters. Modern graphics processing units (GPU) pr...
Pierre Kestener, Frédéric Chât...
ICML
2007
IEEE
14 years 7 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
NIPS
2007
13 years 8 months ago
Measuring Neural Synchrony by Message Passing
A novel approach to measure the interdependence of two time series is proposed, referred to as “stochastic event synchrony” (SES); it quantifies the alignment of two point pr...
Justin Dauwels, François B. Vialatte, Tomas...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 8 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter