Sciweavers

1067 search results - page 7 / 214
» Probabilistic regular graphs
Sort
View
CPC
2007
113views more  CPC 2007»
13 years 9 months ago
Regular Partitions of Hypergraphs: Regularity Lemmas
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...
Vojtech Rödl, Mathias Schacht
ICPR
2010
IEEE
14 years 1 months ago
Kernel-Based Implicit Regularization of Structured Objects
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...
François-Xavier Dupé, Sébastien Bougleux, Luc B...
COLT
2006
Springer
14 years 1 months ago
Uniform Convergence of Adaptive Graph-Based Regularization
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
Matthias Hein
PAKDD
2005
ACM
184views Data Mining» more  PAKDD 2005»
14 years 3 months ago
Adjusting Mixture Weights of Gaussian Mixture Model via Regularized Probabilistic Latent Semantic Analysis
Mixture models, such as Gaussian Mixture Model, have been widely used in many applications for modeling data. Gaussian mixture model (GMM) assumes that data points are generated fr...
Luo Si, Rong Jin
AAECC
2008
Springer
63views Algorithms» more  AAECC 2008»
13 years 10 months ago
Probabilistic algorithms for computing resolvent representations of regular differential ideals
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
Thomas Cluzeau, Evelyne Hubert