361 search results - page 8 / 73 » Algorithms for Extracting Timeliness Graphs |
71
Voted
EMNLP
2008
14 years 11 months ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
42
Voted
LREC
2008
14 years 11 months ago
2008
In this paper, we describe an approach that aims to model heterogeneous resources for information extraction. Document is modeled in graph representation that enables better under...
78
Voted
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
GD
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
73
Voted
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...