7913 search results - page 255 / 1583 » Information Collection on a Graph |
209
click to vote
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
199
click to vote
ADBIS
2010
Springer
15 years 8 months ago
2010
Springer
This paper presents a new method for image retrieval using a graph object oriented database for processing the information extracted from the image through the segmentation process...
200
click to vote
EJC
2011
15 years 2 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
200
click to vote
INFOVIS
2005
IEEE
16 years 25 days ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
217
click to vote
SEMCO
2008
IEEE
16 years 1 months ago
2008
IEEE
Recognizing that information from different sources refers to the same (real world) entity is a crucial challenge in instance-level information integration, as it is a pre-requisi...