Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
16,159
Motion-adaptive transforms based on vertex-weighted graphs
- in Proc. of the IEEE Data Compression Conference
, 2013
"... Motion information in image sequences connects pixels that are highly correlated. In this paper, we consider vertex-weighted graphs that are formed by motion vector information. The vertex weights are defined by scale factors which are introduced to improve the energy compaction of motion-adaptive t ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
Motion information in image sequences connects pixels that are highly correlated. In this paper, we consider vertex-weighted graphs that are formed by motion vector information. The vertex weights are defined by scale factors which are introduced to improve the energy compaction of motion
Minimal invariant sets in a vertex-weighted graph
- THEORETICAL COMPUTER SCIENCE
, 2006
"... A weighting of vertices of a graph is admissible if there exists an edge weighting such that the weight of each vertex equals the sum of weights of its incident edges. Given an admissible vertex weighting of a graph, an invariant set is an edge set such that the sum of the weights of its edges is th ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
A weighting of vertices of a graph is admissible if there exists an edge weighting such that the weight of each vertex equals the sum of weights of its incident edges. Given an admissible vertex weighting of a graph, an invariant set is an edge set such that the sum of the weights of its edges
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
- In Proc. of SODA, 978–985
, 2007
"... Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v), ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v
Motion-Adaptive Transforms Based on the Laplacian of Vertex-Weighted Graphs
"... We construct motion-adaptive transforms for image sequences by using the eigenvectors of Laplacian matrices defined on vertex-weighted graphs, where the weights of the vertices are defined by scale factors. The ver-tex weights determine only the first basis vector of the linear transform uniquely. T ..."
Abstract
- Add to MetaCart
We construct motion-adaptive transforms for image sequences by using the eigenvectors of Laplacian matrices defined on vertex-weighted graphs, where the weights of the vertices are defined by scale factors. The ver-tex weights determine only the first basis vector of the linear transform uniquely
Wiener number of vertex-weighted graphs and a chemical application
- Discrete Appl. Math
, 1997
"... application ..."
Min-max latency walks: Approximation algorithms for monitoring vertex-weighted graphs.
- In Workshop on Algorithmic Foundations of Robotics,
, 2012
"... Abstract In this paper, we consider the problem of planning a path for a robot to monitor a known set of features of interest in an environment. We represent the environment as a vertex-and edge-weighted graph, where vertices represent features or regions of interest. The edge weights give travel t ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract In this paper, we consider the problem of planning a path for a robot to monitor a known set of features of interest in an environment. We represent the environment as a vertex-and edge-weighted graph, where vertices represent features or regions of interest. The edge weights give travel
Average distance in interconnection networks via reduction theorems for vertex-weighted graphs
"... ..."
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract
-
Cited by 892 (13 self)
- Add to MetaCart
is the investigation of the relation between properties of a graph and the spectrum of its adjacency matrix. A central topic and important source of tools is the theory of association schemes. An association scheme is, roughly speaking, a collection of graphs on a common vertex set which fit together in a highly
Pregel: A system for large-scale graph processing
- IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract
-
Cited by 496 (0 self)
- Add to MetaCart
model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertex-centric approach
Results 1 - 10
of
16,159
