Sciweavers

684 search results - page 84 / 137
» A characterization of b-perfect graphs
Sort
View
JSC
2007
84views more  JSC 2007»
14 years 11 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
JMLR
2010
158views more  JMLR 2010»
14 years 6 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
VISUAL
2000
Springer
15 years 3 months ago
Statistical Motion-Based Retrieval with Partial Query
We present an original approach for motion-based retrieval involving partial query. More precisely, we propose an uni ed statistical framework both to extract entities of interest ...
Ronan Fablet, Patrick Bouthemy
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
14 years 12 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
15 years 3 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...