abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
Takayuki Itoh, Chris Muelder, Kwan-Liu Ma, Jun Ses...
This paper proposes an automatic foreground segmentation system based on Gaussian mixture models and dynamic graph cut algorithm. An adaptive perpixel background model is develope...
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...