Sciweavers

441 search results - page 37 / 89
» Convex Graph Invariants
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
ICCV
2003
IEEE
14 years 9 months ago
Images as Bags of Pixels
We propose modeling images and related visual objects as bags of pixels or sets of vectors. For instance, gray scale images are modeled as a collection or bag of (X, Y, I) pixel v...
Tony Jebara
ICML
2009
IEEE
14 years 8 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
SOFSEM
2007
Springer
14 years 1 months ago
Straightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
Sergey Bereg, Markus Völker, Alexander Wolff,...
GD
2009
Springer
13 years 5 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...