Sciweavers

342 search results - page 10 / 69
» Higher order learning with graphs
Sort
View
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
14 years 1 months ago
Stability of a second order consensus algorithm with time delay
—In this paper, we investigate a second order consensus problem in a directed graph with non-uniform time delay. This problem arises naturally in real multi-agent systems such as...
Wen Yang, Andrea L. Bertozzi, Xiaofan Wang
AAAI
2011
12 years 7 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
COMBINATORICS
2000
88views more  COMBINATORICS 2000»
13 years 7 months ago
Note on Sparse Random Graphs and Cover Graphs
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
Tom Bohman, Alan M. Frieze, Miklós Ruszink&...
JMLR
2012
11 years 10 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 11 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...