Data Integration and Knowledge transfer: Application to the tissue:air partition coefficients Cédric Gaudin 1, 2, Gilles Marcou1, Philippe Vayer2, Igor Tetko3, Igor Baskin4, Alexandre Varnek1 * 1 Laboratoire d’Infoch

Source URL: infochim.u-strasbg.fr

JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin

Source URL: jmlr.org

• Mathematics
• Graph theory
• Discrete mathematics
• NP-complete problems
• Combinatorics
• Partition of a set
• Planar separator theorem
• Graph coloring

Distributed Parallel Inference on Large Factor Graphs Joseph E. Gonzalez Carnegie Mellon University

Source URL: select.cs.cmu.edu

• Graphical models
• NP-complete problems
• Coding theory
• Belief propagation
• Probability theory
• Factor graph
• Graph partition
• Ear decomposition
• Distributed computing
• Matching
• Graph coloring
• RochaThatte cycle detection algorithm

Graph répartition du capital décmod

Source URL: www.attijariwafabank.com

COLLINEAR CLUSTER TRI-PARTITION: CURRENT STATUS OF STUDIES D.V. Kamanin1, Yu.V. Pyatkov1,2, A.A. Alexandrov1, I.A. Alexandrova1, N. Jacobs3, N.A. Kondratyev1, E.A. Kuznetsova1, V. Malaza3, O.V. Strekalovsky1, V.E. Zhuchk

Source URL: isinn.jinr.ru

4−CORE PARTITIONS AND CLASS NUMBERS Ken Ono and Lawrence Sze Abstract. Let Ct (n) denote the number of t−core partitions of n, where a partition is a t−core if none of the hook numbers of the associated Ferrers-Yo

Source URL: www.mathcs.emory.edu

Vergleich von Nano- vs Millisekunde 1 Nanosekunde (ns) = 1000 Pikosekunden = 0,Sekunden 1 Mikrosekunde (μs) = 1000 Nanosekunden = 0,Sekunden 1 Millisekunde (ms) = 1000 Mikrosekunden = 0,001 Sekunden

Source URL: www.dbis.cs.uni-frankfurt.de

• Computing
• Distributed computing
• CAP theorem
• Software
• Data management
• Network partition
• Consistency
• System time
• Eric Brewer

Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms David F. Gleich Computer Science Department Purdue University West Lafayette, IN

Source URL: www.stat.berkeley.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph partition
• Connectivity
• Graph coloring
• Graph
• Nonlinear dimensionality reduction
• Vertex
• SPQR tree
• Signed graph

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Edge-enhancing filters with negative weights Knyazev, A. TR2015-142

Source URL: www.merl.com

• Algebra
• Mathematics
• Signal processing
• Algebraic graph theory
• Linear algebra
• Spectral clustering
• Spectral graph theory
• Graph partition
• Wavelet
• Noise reduction
• Optical filter
• Eigenvalues and eigenvectors

COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015

Source URL: www.math.lsa.umich.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph operations
• Graph coloring
• Line graph
• Matching
• Two-graph
• Train track map