Sciweavers

945 search results - page 46 / 189
» Graph Types
Sort
View
143
Voted
CISS
2007
IEEE
15 years 5 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
GISCIENCE
2008
Springer
140views GIS» more  GISCIENCE 2008»
15 years 3 months ago
Modeling Herds and Their Evolvements from Trajectory Data
A trajectory is the time-stamped path of a moving entity through space. Given a set of trajectories, this paper proposes new conceptual definitions for a spatio-temporal pattern n...
Yan Huang, Cai Chen, Pinliang Dong
JGAA
2006
83views more  JGAA 2006»
15 years 1 months ago
On the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
Marc Demange, Tinaz Ekim, Dominique de Werra
JGAA
2007
142views more  JGAA 2007»
15 years 1 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 11 months ago
Counting Plane Graphs: Flippability and its Applications
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...