In this paper, we propose to represent videos as space-time region graphs which capture these two important cues. Our graph nodes are defined by the object region proposals from different frames in a long range video. These nodes are connected by two types of relations: (i) similarity ...
Given applications such as location based services and the spatio-temporal queries they may pose on a spatial network (e.g., road networks), the goal is to develop a simple and expressive model that honors the time dependence of the road network. The model must support the design of efficie...
Based on this, we explore the problem of time-respecting flow graph pattern matching on temporal graphs. This problem motivates important applications in epidemiology, information diffusion, crime detection, etc. To address it, we present one baseline algorithm as well as two optimized algorithms ...
In this paper, we present a unified approach to solving the Hamiltonian problems on distance-hereditary graphs in linear time. 展开 关键词: Hamiltonian problems distance-hereditary graphs graph algorithms linear-time algorithms DOI: 10.1016/j.tcs.2005.04.009 被引量: 58 ...
The main contribution of this paper is to integrate the vast collection of concepts, formalisms and results found in the literature into a unified framework, which we call time-varying graphs (TVGs). Using this framework, it is possible to express directly in the same formalism not only the...
We present a proof that the number of breakpoints in the arrival function between two terminals in graphs of treewidth w w w is n^{O(\log^2 w)} n^{O(\log^2 w)} when the edge arrival functions are piecewise linear. This is an improvement on the bound of n^{\Theta(\log n)} ...
A linear-time recognition algorithm for P4-reducible graphs The P4-reducible graphs are a natural generalization of the well-known class of cographs, with applications to scheduling, computational semantics, and clu... B.,Jamison,and,... - 《Theoretical Computer Science》 被引量: 79发表: 1995...
Stock graph - graphs to show the highest stock price, lowest stock price, and closing stock price as bands on a time axis. Stock graphs are useful for comparing the prices of different stocks or the stock price of an individual stock over time (for more information, see "Notes about creat...
Question answering over temporal knowledge graphs (KGs) efficiently uses facts contained in a temporal KG, which records entity relations and when they occur in time, to answer natural language questions (e.g., "Who was the president of the US before Obama?"). These questions often involve th...
6, where we show that the lips tangle L (see Fig. 1) guarantees connected and envy-free allocations for three agents, via an argument that elaborates Stromquist's well-known moving knife method [18] over [0, 1]; the additional complexity for L arises from the need to take explicit ...